Codegree conditions for tiling complete $k$-partite $k$-graphs and loose cycles

Wei Gao, Jie Han, Yi Zhao

Given two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, a perfect $F$-tiling (or an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex…