Exact minimum codegree threshold for $K_4^{-}$-factors

Jie Han, Allan Lo, Andrew Treglown +1

Given hypergraphs $F$ and $H$, an $F$-factor in $H$ is a set of vertex-disjoint copies of $F$ which cover all the vertices in $H$. Let $K_4^{-}$ denote the $3$-uniform hypergraph wi…