The degree and codegree threshold for linear triangle covering in 3-graphs

Yuxuan Tang, Yue Ma, Xinmin Hou

Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if every vertex in $G$ is contained in a copy of $F$. For $1\le i\le k-1$, let $c_i(n,F)$ be the…