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

### Cite this

*Electronic Journal of Combinatorics*,

*18*(1), 1-9.

}

*Electronic Journal of Combinatorics*, vol. 18, no. 1, pp. 1-9.

**An entropy proof of the Kahn-Lovász theorem.** / Cutler, Jonathan; Radcliffe, A. J.

Research output: Contribution to journal › Article

TY - JOUR

T1 - An entropy proof of the Kahn-Lovász theorem

AU - Cutler, Jonathan

AU - Radcliffe, A. J.

PY - 2011/2/7

Y1 - 2011/2/7

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

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

UR - http://www.scopus.com/inward/record.url?scp=79551516138&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:79551516138

VL - 18

SP - 1

EP - 9

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 1

ER -