An entropy proof of the Kahn-Lovász theorem

Jonathan Cutler; A. J. Radcliffe

doi:10.37236/497

An entropy proof of the Kahn-Lovász theorem

Jonathan Cutler
, A. J. Radcliffe

Mathematics

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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
DOIs	https://doi.org/10.37236/497
State	Published - 2011

Access to Document

10.37236/497

Cite this

@article{1b35d1bf52314f91a7093ebb98995353,

title = "An entropy proof of the Kahn-Lov{\'a}sz theorem",

abstract = "Br{\`e}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{\'a}sz [8] extended Br{\`e}gman's theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lov{\'a}sz theorem. Our methods build on Radhakrishnan's [9] use of entropy to prove Br{\`e}gman's theorem.",

author = "Jonathan Cutler and Radcliffe, \{A. J.\}",

year = "2011",

doi = "10.37236/497",

language = "English",

volume = "18",

pages = "1--9",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Australian National University",

number = "1",

}

TY - JOUR

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

AU - Cutler, Jonathan

AU - Radcliffe, A. J.

PY - 2011

Y1 - 2011

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 - https://www.scopus.com/pages/publications/79551516138

U2 - 10.37236/497

DO - 10.37236/497

M3 - Article

AN - SCOPUS:79551516138

SN - 1077-8926

VL - 18

SP - 1

EP - 9

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

An entropy proof of the Kahn-Lovász theorem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this