Nearly Perfect Matchings in Uniform Hypergraphs
Hongliang Lu, Xingxing Yu, Xiaofan Yuan · SIAM Journal on Discrete Mathematics · 2021
We prove that, for any integers $k,l$ with $k\ge 3$ and $k/2 {n-l\choose k-l}-{(n-l)-m\choose k-l}$, then $H$ has a matching of size $m+1$. This improves upon an earlier result of Hàn, Person, and Schacht for the range $k/2