Matchings and independent sets of a fixed size in regular graphs
From MaRDI portal
Publication:1040835
DOI10.1016/j.jcta.2008.12.008zbMath1243.05193arXiv1206.3211OpenAlexW2083618772MaRDI QIDQ1040835
Teena Carroll, Prasad Tetali, David Galvin
Publication date: 26 November 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3211
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs ⋮ Asymptotics of the upper matching conjecture ⋮ The independent set sequence of regular bipartite graphs ⋮ On Independent Sets in Graphs with Given Minimum Degree ⋮ The Number of Independent Sets in a Regular Graph ⋮ Independent sets in graphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree ⋮ Counting sum-free sets in abelian groups ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Birthday inequalities, repulsion, and hard spheres ⋮ An upper bound for the number of independent sets in regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the validations of the asymptotic matching conjectures
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
- Theory of monomer-dimer systems
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Hypergraphs, Entropy, and Inequalities
- On weighted graph homomorphisms
- Information Inequalities for Joint Distributions, With Interpretations and Applications
This page was built for publication: Matchings and independent sets of a fixed size in regular graphs
