| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777378 | European Journal of Combinatorics | 2017 | 20 Pages |
Abstract
We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence d=(d1,â¦,dn), provided that the number of edges is at least n+12dmax4, where dmax is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Prüfer codes.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Catherine Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay,