The Tur\'an number of Berge-K4 in triple systems
Abstract
A Berge-K4 in a triple system is a configuration with four vertices v1,v2,v3,v4 and six distinct triples \eij: 1 i< j 4\ such that \vi,vj\⊂ eij for every 1 i<j 4. We denote by B the set of Berge-K4 configurations. A triple system is B-free if it does not contain any member of B. We prove that the maximum number of triples in a B-free triple system on n 6 points is obtained by the balanced complete 3-partite triple system: all triples \abc: a∈ A, b∈ B, c∈ C\ where A,B,C is a partition of n points with n 3=|A| |B| |C|=n 3.
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.