Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy.

Shmuel Friedland Leonid Gurvits Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. 347-361 2008 17 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548307008747 db/journals/cpc/cpc17.html#FriedlandG08