The number of spanning trees in graphs with a given degree sequence

DOI10.1002/rsa.3240060214zbMath0819.05032OpenAlexW2152950619MaRDI QIDQ4697817

Alexandr V. Kostochka

Publication date: 27 August 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060214

zbMATH Keywords

degree sequencenumber of spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (10)

The local limit of the uniform spanning tree on dense graphs ⋮ The number of bounded‐degree spanning trees ⋮ Spanning tree bounds for grid graphs ⋮ On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs ⋮ Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans ⋮ On the minimum number of spanning trees in cubic multigraphs ⋮ Bounding the number of bases of a matroid ⋮ The minimum number of spanning trees in regular multigraphs ⋮ Spanning trees in random series-parallel graphs ⋮ The average number of spanning trees in sparse graphs with given degrees

Cites Work

• Spanning trees in regular graphs
• The number of spanning trees in regular graphs

This page was built for publication: The number of spanning trees in graphs with a given degree sequence