Article contents
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
Published online by Cambridge University Press: 01 May 2008
Abstract
We derive here the Friedland–Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It is shown that some of these bounds are asymptotically sharp. We improve the known lower bound for the three-dimensional monomer–dimer entropy.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2007
References
- 6
- Cited by