On the number of forests and connected spanning subgraphs
From MaRDI portal
Publication:2053728
DOI10.1007/s00373-021-02382-xzbMath1479.05150arXiv2005.12752OpenAlexW3190606081MaRDI QIDQ2053728
Péter Csikvári, Haoran Luo, Márton Borbényi
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.12752
Trees (05C05) Graph polynomials (05C31) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Evaluations of Tutte polynomials of regular graphs ⋮ Upper bound for the number of spanning forests of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shattering, graph orientations, and connectivity
- On some Tutte polynomial sequences in the square lattice
- Spanning trees and orientation of graphs
- Spanning trees in regular graphs
- The expected eigenvalue distribution of a large regular graph
- Forests and score vectors
- Correlation inequalities on some partially ordered sets
- Forests, colorings and acyclic orientations of the square lattice
- Improved bounds for the number of forests and acyclic orientations in the square lattice
- Acyclic orientations of graphs
- 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
- Minors in lifts of graphs
- Negative association in uniform forests and connected graphs
- Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds
- Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices
- An introduction to chromatic polynomials
This page was built for publication: On the number of forests and connected spanning subgraphs
