Brègman , gave a best possible upper bound for the number of perfect matchings in a balanced bipartite graph in terms of its degree sequence. Recently Kahn and Lovász  extended Brègman's theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lovász theorem. Our methods build on Radhakrishnan's  use of entropy to prove Brègman's theorem.
|Number of pages||9|
|Journal||Electronic Journal of Combinatorics|
|State||Published - 7 Feb 2011|