Upper bound for the number of spanning forests of regular graphs

DOI10.1016/j.ejc.2022.103677OpenAlexW3162973312MaRDI QIDQ2700981

Ferenc Bencs, Péter Csikvári

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

matching polynomialLaplacian matrices

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees and orientation of graphs
• Spanning trees in regular graphs
• On the number of forests and connected spanning subgraphs
• Evaluations of Tutte polynomials of regular graphs
• The Tutte polynomial
• Theory of monomer-dimer systems
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• Towards a theory of negative dependence
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Minors in lifts of graphs
• On the computational complexity of the Jones and Tutte polynomials
• Negative association in uniform forests and connected graphs
• Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Upper bound for the number of spanning forests of regular graphs