An entropy proof of the Kahn-Lovász theorem

Jonathan Cutler, A. J. Radcliffe

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 languageEnglish
Pages (from-to)1-9
Number of pages9
JournalElectronic Journal of Combinatorics
Volume18
Issue number1
StatePublished - 7 Feb 2011

Fingerprint

Entropy
Theorem
Entropy Method
Degree Sequence
Perfect Matching
Bipartite Graph
Upper bound
Graph in graph theory

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",
month = "2",
day = "7",
language = "English",
volume = "18",
pages = "1--9",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "1",

}

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

In: Electronic Journal of Combinatorics, Vol. 18, No. 1, 07.02.2011, p. 1-9.

Research output: Contribution to journalArticle

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 -