Computing Asymptotic Average Leaf Density in Spanning Trees of some Graph Families

Start Date: October 21, 2026
End Date: October 21, 2026
Event Start Time: 12:15 PM
Event End Time: 1:15 PM
Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
Seminar Type: Current Seminars
Seminar Series: Graduate Combinatorics Seminar
Presenter(s): Pablo Blanco, Rutgers University
Presentation Type: Stand Alone Presentation
Abstract:
The Matrix-Tree Theorem famously gives us a way to quickly compute the number of spanning trees of a graph. For certain types of graph families, we can go a step further: we can compute generating functions for number of spanning trees, number of leaves, and to compute asymptotic leaf density (across all spanning trees). In a joint paper with Doron Zeilberger, we considered the graph families: (for k fixed) k x n grid graphs, k x n torus graphs, (k-) powers of cycles, and (k-) powers of paths.

Events