An entropy proof of the Kahn-Lovasz theorem

Authors

Jonathan Cutler, Montclair State UniversityFollow
A. J. Radcliffe, University of Nebraska-LincolnFollow

Document Type

Article

Date of this Version

2011

Citation

The Electronic Journal of Combinatorics 18

Abstract

Bregman [2], 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 Lovasz [8] extended Bregman’s theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lovasz theorem. Our methods build on Radhakrishnan’s [9] use of entropy to prove Bregman’s theorem.