### 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.

Original language | English |
---|---|

Pages (from-to) | 1-9 |

Number of pages | 9 |

Journal | Electronic Journal of Combinatorics |

Volume | 18 |

Issue number | 1 |

State | Published - 7 Feb 2011 |

## Fingerprint Dive into the research topics of 'An entropy proof of the Kahn-Lovász theorem'. Together they form a unique fingerprint.

## Cite this

Cutler, J., & Radcliffe, A. J. (2011). An entropy proof of the Kahn-Lovász theorem.

*Electronic Journal of Combinatorics*,*18*(1), 1-9.