The minimum number of spanning trees in regular multigraphs
From MaRDI portal
Publication:2112560
DOI10.37236/10911zbMath1506.05101OpenAlexW4309458252MaRDI QIDQ2112560
Jean-Sébastien Sereni, Zelealem B. Yilma, Jakub Pekárek
Publication date: 11 January 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/10911
Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of spanning trees in random regular graphs
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- Spanning trees in regular graphs
- A bound for the complexity of a simple graph
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Coverings, heat kernels and spanning trees
- On the minimum number of spanning trees in cubic multigraphs
- The average number of spanning trees in sparse graphs with given degrees
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
- Subgraphs of Dense Random Graphs with Specified Degrees
- Do nearly balanced multigraphs have more spanning trees?
- The number of spanning trees in regular graphs
- The number of spanning trees in graphs with a given degree sequence
- Subgraph counts for dense random graphs with specified degrees
This page was built for publication: The minimum number of spanning trees in regular multigraphs