Turán numbers for 3-uniform linear paths of length 3 (Q286115): Difference between revisions

Summary: In this paper we confirm a special, remaining case of a conjecture of \textit{Z. Füredi} et al. [Combinatorica 34, No. 3, 299--322 (2014; Zbl 1324.05192)], and determine an exact~formula for the Turán number \(\mathrm{ex}_3(n; P_3^3)\) of the 3-uniform linear path \(P^3_3\) of length 3, valid for all \(n\). It coincides with the analogous formula for the 3-uniform triangle \(C^3_3\), obtained earlier by \textit{P. Frankl} and \textit{Z. Füredi} [J. Comb. Theory, Ser. A 45, 226--262 (1987; Zbl 0661.05003)] for \(n\geqslant 75\) and \textit{R. Csákány} and \textit{J. Kahn} [J. Algebr. Comb. 9, No. 2, 141--149 (1999; Zbl 0916.05069)] for all \(n\). In view of this coincidence, we also determine a `conditional' Turán number, defined as the maximum number of edges in a \(P^3_3\)-free 3-uniform hypergraph on \(n\) vertices which is not \(C^3_3\)-free.