Matching of given sizes in hypergraphs

Yulin Chang, Huifen Ge, Jie Han +1

For all integers $k,d$ such that $k\ge 3$ and $k/2\le d\le k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/…