An Entropy Proof of the Kahn-Lovász Theorem

Authors

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

Document Type

Article

Publication Date

2-7-2011

Journal / Book Title

The Electronic Journal of Combinatorics

Abstract

Brègman [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 Lovász [8] 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 [9] use of entropy to prove Brègman's theorem.

Comments

This article is Open Access via the publisher.

DOI

10.37236/497

Journal ISSN / Book ISBN

ISSN: 10778926

MSU Digital Commons Citation

Cutler, Jonathan and Radcliffe, A. J., "An Entropy Proof of the Kahn-Lovász Theorem" (2011). Department of Mathematics Facuty Scholarship and Creative Works. 40.
https://digitalcommons.montclair.edu/mathsci-facpubs/40

Published Citation

Cutler, J., & Radcliffe, A. J. (2011). An entropy proof of the Kahn-Lovász theorem. Electronic Journal of Combinatorics, 18(1), 1-9. https://doi.org/10.37236/497