Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
From MaRDI portal
Publication:3545903
DOI10.1017/S0963548307008747zbMath1162.05038OpenAlexW2150949626MaRDI QIDQ3545903
Leonid Gurvits, Shmuel Friedland
Publication date: 11 December 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548307008747
Related Items
Counting matchings via capacity-preserving operators, Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, Statistical Matching Theory, On the validations of the asymptotic matching conjectures, Nash Social Welfare, Matrix Permanent, and Stable Polynomials, Sequential cavity method for computing free energy and surface pressure
Cites Work
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- A lower bound for the permanent of a doubly stochastic matrix
- Counting 1-factors in regular bipartite graphs
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
- Theory of monomer-dimer systems
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
- A proof of a generalized van der Waerden conjecture on permanents
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- On the Permanent of a Bistochastik Matrix.
