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 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.
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}
}