A Lower Bound for the Monomer-Dimer Problem

DOI10.1093/imamat/6.4.341zbMath0223.05015OpenAlexW2130118060MaRDI QIDQ5628139

J. M. Hammersley, V. V. Menon

Publication date: 1970

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/6.4.341

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

Some Recurrence Relations of Recursive Minimization, Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, The monopole-dimer model for Cartesian products of graphs: extended abstract, Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems, The monopole-dimer model on Cartesian products of plane graphs, Statistical Matching Theory, An asymptotic expansion and recursive inequalities for the monomer-dimer problem, On the validations of the asymptotic matching conjectures, Theory of monomer-dimer systems, Sequential cavity method for computing free energy and surface pressure, Theory of computation of multidimensional entropy with an application to the monomer-dimer problem, Approximating the number of monomer-dimer coverings of a lattice., A statistical model of current loops and magnetic monopoles