Claims

../

1978_01_01_ruzsa_szemeredi: Ruzsa and Szemerédi's 1978 theorem that a 3-uniform hypergraph on n vertices in which no six vertices span three edges has o(n^2) edges, answering the Brown, Erdős and Sós question yes; the bound is nearly sharp.

---