Exact minimum codegree thresholds for $K_4^{-}$-covering and $K_5^{-}$-covering

Lei Yu, Xinmin Hou, Boyuan Liu +1

Given two $3$-graphs $F$ and $H$, an $F$-covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let {$c_2(n…