Turán numbers for 3-uniform linear paths of length 3

preprint2015arXivOpen access

Abstract

In this paper we confirm a conjecture of Füredi, Jiang, and Seiver, and determine an exact formula for the Turán 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üredi for n≥75n\ge 75 and Csákány and Kahn for all nn. In view of this coincidence, we also determine a `conditional' Turán 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.