An entropy proof of the Kahn-Lovász theorem
From MaRDI portal
Publication:625372
zbMath1229.05137MaRDI QIDQ625372
Jonathan Cutler, Andrew John Radcliffe
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/223259
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (7)
Extremal Graphs With a Given Number of Perfect Matchings ⋮ Asymptotics of the upper matching conjecture ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Asymptotics for Shamir's problem ⋮ Graphs with the fewest matchings ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ An upper bound on the number of Steiner triple systems
This page was built for publication: An entropy proof of the Kahn-Lovász theorem
