On 3-Hypergraphs with Forbidden 4-Vertex Configurations

Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a rather elaborate application of Cauchy

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Alexander A. Razborov
• Keywords: Edge Density, Flag Algebras, Hypergraph Tur´an Densities, SIAMDM 2010