Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs

DOI10.1016/j.physa.2015.05.106zbMath1400.82098arXiv1502.06734OpenAlexW2963244375MaRDI QIDQ1618724

Paolo Butera, Paul Federbush, Mario Pernici

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

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

zbMATH Keywords

graph entropydimer problemupper bounds on matchings in regular graphs

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Asymptotics of the upper matching conjecture
• An asymptotic expansion and recursive inequalities for the monomer-dimer problem
• 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 positivity property of the dimer entropy of graphs
• Tight bounds on maximal and maximum matchings
• Minkowski's inequality and sums of squares
• Theory of monomer-dimer systems
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• The Pressure, Densities and First-order Phase Transitions Associated with Multidimensional SOFT
• Results and open problems in matchings in regular graphs