Pablo Blanco

I am currently a fourth-year PhD Candidate in the Rutgers Mathematics Department. I am advised by Doron Zeilberger (at Rutgers) and advised by Vaidy Sivaraman. Before this, I completed my undergraduate degree A.B. in Mathematics at Princeton University, with a certificate in Applications of Computing.

My primary research interest is in Structural Graph Theory.

Pablo Blanco

Contact Information

E-mail: pablancoh (at) aol (dot) com
Office Address: Rutgers, The State University,
Department of Mathematics
110 Frelinghuysen Road
Piscataway NJ 08854-8019
Office Location: Hill Center 638

Research:

Here is a link to my undergraduate thesis:
  • Graphs with Large Overlap in Their Spanning Trees. [link]
    Advised by Rose McCarty. 2023.

    • Submitted or Preprint:
  • Counting (and Randomly Generating) Hamiltonian Cycles in Rectangular Grids [arXiv]
    With Doron Zeilberger. 2026.
  • In How Many Ways can a Rectangle be Rectangled? [arXiv]
    With Robert Dougherty-Bliss, Natalya Ter-Saakov, Doron Zeilberger. 2026.


    • To appear:

    Published:
  • Automated Counting of Spanning Trees for Several Infinite Families of Graphs [Article][arXiv]
    Enumerative Combinatorics and Applications. With Doron Zeilberger. 2025.
  • On tree decompositions whose trees are minors. [Article] [arXiv]
    Journal of Graph Theory. With Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, and Rose McCarty. 2023.
  • Towards the Erdős-Hajnal conjecture for P_5-free graphs [Article][arXiv]
    Research in the Mathematical Sciences. With Matija Bucić. 2022.

    • Coding Projects:

    All of the code below is (human-)written (by me!) in Maple.

    Random Generation of Partitions in the Grid Graph, with prescribed edge probabilities
    These supplementary procedures allow for fast random generation of either Recto puzzles (which accompanies the Recto package)
    or partitions of a grid graph (to accompany the RectTile package). For sample outputs, see this.
    The code is available [ Here].

    Computing Asymptotic Average Leaf Density (in certain graph families)
    This project was done under the supervision of Doron Zeilberger.
    The link for the code will be [Here]. The accompanying article.

    Study on the Statistics of the English Language:
    The following project was done in collaboration with Aurora Hiveley and Kaylee Weatherspoon, under the supervision
    of Doron Zeilberger. The paper below describes the scope of the project, while the Maple code provides the tools we
    constructed to arrive at our conclusions. The ENGLISH.txt linked is the database which our code uses.
    [Paper][Code][ENGLISH.txt]

    Acknowledged in:

  • Bounds for Rainbow-uncommon Graphs [To appear in Involve] [arXiv]
    by B. Bates, Z. Berikkyzy, N. Chiem, G. Elvin, R. Fines, M. Lie, H. Mikulas, I. Reiter, K. Zhou.