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

Summary: 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\leqslant i \leqslant k-1\), let \(c_i (n, F)\) be the least integer such that every \(n\)-vertex \(k\)-uniform hypergraph \(G\) with \(\delta_i(G)> c_i (n, F)\) has an \(F\)-covering. The covering problem has been systematically studied by \textit{V. Falgas-Ravry} and \textit{Y. Zhao} [SIAM J. Discrete Math. 30, No. 4, 1899--1917 (2016; Zbl 1346.05199)]. Last year, \textit{V. Falgas-Ravry} et al. [Comb. Probab. Comput. 30, No. 2, 175--199 (2020; Zbl 1466.05180)] asymptotically determined \(c_1(n, F)\) when \(F\) is the generalized triangle. In this note, we give the exact value of \(c_2 (n, F)\) and asymptotically determine \(c_1(n, F)\) when \(F\) is the linear triangle \(C_6^3\), where \(C_6^3\) is the 3-uniform hypergraph with vertex set \(\{v_1, v_2, v_3, v_4, v_5, v_6\}\) and edge set \(\{v_1v_2v_3, v_3v_4v_5, v_5v_6v_1\}\).