The Turán number of the Fano plane (Q2368588): Difference between revisions

It is proved that for \(n\geq n_0\), the maximal number of edges in a 3-uniform hypergraph on \(n\) vertices not containing a Fano plane is \(\binom{n}{3} - \binom{\lfloor n/2\rfloor}{3}-\binom{\lceil n/2\rceil}{3}\). This settles an old conjecture of Vera T.~Sós. To show the result, the authors prove that for every \(\varepsilon>0\) there is a \(\delta>0\) such that if \(H\) is a 3-uniform hypergraph on \(n\) vertices with \((\frac{3}{4}-\delta)\binom{n}{3}\) edges, with no Fano plane then there is a partition \((A,B)\) of the vertex set with \(e(A)+e(B)<\varepsilon n^3\).