Location of Repository

AN ENTROPY PROOF OF THE KAHN-LOVÁSZ THEOREM

By Jonathan Cutler and A. J. Radcliffe

Abstract

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

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.187.2107
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.unl.edu/%7Eara... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.