Tur\'an numbers for 3-uniform linear paths of length 3
classification
🧮 math.CO
keywords
uniformnumberdetermineformulafreelengthlinearuredi
read the original abstract
In this paper we confirm a conjecture of F\"uredi, Jiang, and Seiver, and determine an exact formula for the Tur\'an number $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 Frankl and F\"uredi for $n\ge 75$ and Cs\'ak\'any and Kahn for all $n$. In view of this coincidence, we also determine a `conditional' Tur\'an number, defined as the maximum number of edges in a $P^3_3$-free 3-uniform hypergraph on $n$ vertices which is \emph{not} $C^3_3$-free.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.