Tiling multipartite hypergraphs in Quasi-random Hypergraphs

Given $k\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an $F$-factor in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi [J. Combin. Theory Ser. B, 2016] studied the $F$-factor problems in quasi-random $k$-graphs with minimum degree $\Omega(n^{k-1})$. In particular, they constructed a sequence of $1/8$-dense quasi-random $3$-graphs $H(n)$ with minimum degree $\Omega(n^2)$ having no $K_{2,2,2}$-factor. We prove that if $p>1/8$ and $F$ is a $3$-partite $3$-graph with $f$ vertices, then for sufficiently large $n$, all $p$-dense quasi-random $3$-graphs of order $n$ with minimum codegree $\Omega(n)$ and $f\mid n$ have $F$-factors. That is, $1/8$ is the threshold for embedding all $3$-partite $3$-graphs in $p$-dense quasi-random $3$-graphs given a minimum codegree condition $\Omega(n)$. Moreover, we show that one can not replace the minimum codegree condition by a minimum vertex degree condition. In fact, we find that for any $p\in(0,1)$ and $n\ge n_0$, there exist $p$-dense quasi-random $3$-graphs of order $n$ with minimum degree $\Omega (n^2)$ having no $K_{2,2,2}$-factor. We also study $3$-graphs $F$ such that every sufficiently large quasi-random $3$-graph with positive density and minimum codegree $\Omega(n)$ contains an $F$-factor. In addition, we study $F$-factor problems for $k$-partite $k$-graphs $F$ with stronger quasi-random assumption and minimum degree $\Omega(n^{k-1})$.Comment: 20 pages. arXiv admin note: substantial text overlap with arXiv:2108.1073