English

Tur\'an numbers for 3-uniform linear paths of length 3

Combinatorics 2015-06-12 v1

Abstract

In this paper we confirm a conjecture of F\"uredi, Jiang, and Seiver, and determine an exact formula for the Tur\'an number ex3(n;P33)ex_3(n; P_3^3) of the 3-uniform linear path P33P^3_3 of length 3, valid for all nn. It coincides with the analogous formula for the 3-uniform triangle C33C^3_3, obtained earlier by Frankl and F\"uredi for n75n\ge 75 and Cs\'ak\'any and Kahn for all nn. In view of this coincidence, we also determine a `conditional' Tur\'an number, defined as the maximum number of edges in a P33P^3_3-free 3-uniform hypergraph on nn vertices which is \emph{not} C33C^3_3-free.

Keywords

Cite

@article{arxiv.1506.03759,
  title  = {Tur\'an numbers for 3-uniform linear paths of length 3},
  author = {Eliza Jackowska and Joanna Polcyn and Andrzej Ruciński},
  journal= {arXiv preprint arXiv:1506.03759},
  year   = {2015}
}