Turán numbers for 3-uniform linear paths of length 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

e x_{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 g e 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.

Full work available at URL: https://arxiv.org/abs/1506.03759

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (11)

This page was built for publication: Turán numbers for 3-uniform linear paths of length 3