$F$-factors in hypergraphs via absorption

Allan Lo, Klas Markström

Given integers $n\ge k>l\ge 1$ and a $k$-graph $F$ with $|V(F)|$ divisible by $n$, define $t_l^k(n,F)$ to be the smallest integer $d$ such that every $k$-graph $H$ of order $n…