Geodesic
An entropy proof of the Kahn-Lovász theorem
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Brègman 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 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 use of entropy to prove Brègman's theorem.
DOI : 10.37236/497
Classification : 05C35, 05C70, 05C07
Mots-clés : perfect matchings, bipartite graph, degree sequence 
@article{10_37236_497,
     author = {Jonathan Cutler and A. J. Radcliffe},
     title = {An entropy proof of the {Kahn-Lov\'asz} theorem},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/497},
     zbl = {1229.05137},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/497/}
}
TY  - JOUR
AU  - Jonathan Cutler
AU  - A. J. Radcliffe
TI  - An entropy proof of the Kahn-Lovász theorem
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/497/
DO  - 10.37236/497
ID  - 10_37236_497
ER  - 
%0 Journal Article
%A Jonathan Cutler
%A A. J. Radcliffe
%T An entropy proof of the Kahn-Lovász theorem
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/497/
%R 10.37236/497
%F 10_37236_497
Jonathan Cutler; A. J. Radcliffe. An entropy proof of the Kahn-Lovász theorem. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/497

Cité par Sources :