Hyunwoo Lee

Kahn--Lov\'{a}sz-type inequalities for graph factors

The Kahn--Lov\'{a}sz theorem gives a sharp upper bound on the number of perfect matchings in a graph in terms of its degree sequence, extending the classical Br\'{e}gman--Minc inequality for bipartite graphs. In this paper, we establish an asymptotically sharp extension of the Kahn--Lov\'{a}sz theorem to $F$-factors fo...