On Matchings in Hypergraphs

[摘要] We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n>2k^2s/\log k$, then $H$ has at most $\binom n k - \binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in which

[学科分类] 离散数学和组合数学

[关键词] extremal graph theory;matching;hypergraphs