Codegree threshold for tiling $k$-graphs with two edges sharing exactly $\ell$ vertices

Lei Yu, Xinmin Hou

Given integer $k$ and a $k$-graph $F$, let $t_{k-1}(n,F)$ be the minimum integer $t$ such that every $k$-graph $H$ on $n$ vertices with codegree at least $t$ contains an $F$-factor…