arXiv Analytics

Sign in

arXiv:1807.11211 [math.CO]AbstractReferencesReviewsResources

The Turán number of Berge-K_4 in triple systems

Andras Gyarfas

Published 2018-07-30Version 1

A Berge-$K_4$ in a triple system is a configuration with four vertices $v_1,v_2,v_3,v_4$ and six distinct triples $\{e_{ij}: 1\le i< j \le 4\}$ such that $\{v_i,v_j\}\subset e_{ij}$ for every $1\le i<j\le 4$. We denote by $\cal{B}$ the set of Berge-$K_4$ configurations. A triple system is $\cal{B}$-free if it does not contain any member of $\cal{B}$. We prove that the maximum number of triples in a $\cal{B}$-free triple system on $n\ge 6$ points is obtained by the balanced complete $3$-partite triple system: all triples $\{abc: a\in A, b\in B, c\in C\}$ where $A,B,C$ is a partition of $n$ points with $$\left\lfloor{n\over 3}\right\rfloor=|A|\le |B|\le |C|=\left\lceil{n\over 3}\right\rceil.$$

Related articles: Most relevant | Search more
arXiv:math/0602191 [math.CO] (Published 2006-02-09, updated 2007-03-02)
On the maximum number of cliques in a graph
arXiv:1102.2141 [math.CO] (Published 2011-02-10)
The Turán number of $F_{3,3}$
arXiv:0906.4142 [math.CO] (Published 2009-06-22, updated 2011-03-30)
The maximum number of cliques in a graph embedded in a surface