Tur\'an 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 ex3(n; P33) of the 3-uniform linear path P33 of length 3, valid for all n. It coincides with the analogous formula for the 3-uniform triangle C33, obtained earlier by Frankl and F\"uredi for n 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 P33-free 3-uniform hypergraph on n vertices which is not C33-free.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…