Tur\'an numbers for 3-uniform linear paths of length 3
Eliza Jackowska, Joanna Polcyn, Andrzej Ruci\'nski

TL;DR
This paper proves an exact formula for the Turán number of a specific 3-uniform linear path of length 3, confirming a conjecture and linking it to the Turán number of a 3-uniform triangle.
Contribution
It establishes the exact Turán number for the 3-uniform linear path of length 3, confirming a conjecture and connecting it with known results for 3-uniform triangles.
Findings
Exact formula for $ex_3(n; P_3^3)$ for all n.
The Turán number coincides with that of the 3-uniform triangle for large n.
Determination of a conditional Turán number related to $P_3^3$ and $C_3^3$.
Abstract
In this paper we confirm a conjecture of F\"uredi, Jiang, and Seiver, and determine an exact formula for the Tur\'an number of the 3-uniform linear path of length 3, valid for all . It coincides with the analogous formula for the 3-uniform triangle , obtained earlier by Frankl and F\"uredi for and Cs\'ak\'any and Kahn for all . In view of this coincidence, we also determine a `conditional' Tur\'an number, defined as the maximum number of edges in a -free 3-uniform hypergraph on vertices which is \emph{not} -free.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research
