On the number of spanning trees in random regular graphs

Catherine Greenhill, Matthew Kwan, David Wind

Let $d\ge 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotic…