On the number of spanning trees in random regular graphs

zbMath1300.05283arXiv1309.6710MaRDI QIDQ405137

Catherine Greenhill, David Wind, Matthew Kwan

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6710

zbMATH Keywords

random regular graphsspanning treessmall subgraph conditioning

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (4)

Random tree-weighted graphs ⋮ Spanning trees in random regular uniform hypergraphs ⋮ The minimum number of spanning trees in regular multigraphs ⋮ The average number of spanning trees in sparse graphs with given degrees

Cites Work

• The asymptotic number of spanning trees in circulant graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Forests, colorings and acyclic orientations of the square lattice
• The Merino-Welsh conjecture holds for series-parallel graphs
• On Spanning Trees, Weighted Compositions, Fibonacci Numbers, and Resistor Networks
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• On the Number of Perfect Matchings in Random Lifts
• Asymptotic Enumeration of Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of spanning trees in random regular graphs