The degree threshold for covering with all the connected $3$-graphs with $3$ edges

Yue Ma, Xinmin Hou, Zhi Yin

Given two $r$-uniform hypergraphs $F$ and $H$, we say that $H$ has an $F$-covering if every vertex in $H$ is contained in a copy of $F$. Let $c_i(n,F)$ be the least integer such…