On the Validations of the Asymptotic Matching Conjectures
@article{Friedland2006OnTV, title={On the Validations of the Asymptotic Matching Conjectures}, author={S. Friedland and E. Krop and P. H. Lundow and K. Markstr{\"o}m}, journal={Journal of Statistical Physics}, year={2006}, volume={133}, pages={513-533} }
In this paper we review the asymptotic matching conjectures for r-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in d-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of r-regular tori graphs and give algorithms for computing the monomer-dimer entropy of density p, for any p∈[0,1], for… CONTINUE READING
35 Citations
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy
- Mathematics, Computer Science
- Comb. Probab. Comput.
- 2008
- 26
- PDF
Matchings and independent sets of a fixed size in regular graphs
- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 2009
- 32
- PDF
An Asymptotic Expansion and Recursive Inequalities for the Monomer-Dimer Problem
- Mathematics, Physics
- 2011
- 15
- PDF
Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs
- Mathematics, Physics
- 2015
- 1
- PDF
Asymptotics of the Upper Matching Conjecture
- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 2013
- 11
- PDF
Independent sets, matchings, and occupancy fractions
- Mathematics, Computer Science
- J. Lond. Math. Soc.
- 2017
- 36
- PDF
References
SHOWING 1-10 OF 50 REFERENCES
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy
- Mathematics, Computer Science
- Comb. Probab. Comput.
- 2008
- 26
- PDF
On the Number of Matchings in Regular Graphs
- Mathematics, Computer Science
- Electron. J. Comb.
- 2008
- 45
- PDF
The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice
- Mathematics
- 1961
- 878
Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Mathematics, Physics
- Adv. Appl. Math.
- 2005
- 55
- PDF
Counting 1-Factors in Regular Bipartite Graphs
- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1998
- 118
- PDF