Asymptotics of the upper matching conjecture

DOI10.1016/j.jcta.2013.01.013zbMath1277.05004arXiv1205.4342OpenAlexW2032529651WikidataQ122965877 ScholiaQ122965877MaRDI QIDQ385029

L. Ilinca, Jeffry Kahn

Publication date: 29 November 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

entropyasymptoticsupper matching conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Asymptotic enumeration (05A16)

Related Items (4)

Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Birthday inequalities, repulsion, and hard spheres

Cites Work

• Unnamed Item
• Unnamed Item
• Entropy bounds for perfect matchings and Hamiltonian cycles
• An entropy proof of the Kahn-Lovász theorem
• The maximum number of perfect matchings in graphs with a given degree sequence
• On the number of matchings in regular graphs
• On the validations of the asymptotic matching conjectures
• Matchings and independent sets of a fixed size in regular graphs
• A short proof of Minc's conjecture
• An inequality for permanent of (0, 1)-matrices
• Combinatorial Matrix Functions and 1-Factors of Graphs
• An entropy proof of Bregman's theorem

This page was built for publication: Asymptotics of the upper matching conjecture