Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering
Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering
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,F)$ be the minimum integer $t$ such that every 3-graph with minimum codegree greater than …