Sciweavers

SIAMDM
2010
87views more  SIAMDM 2010»
13 years 6 months ago
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 r...
Alexander A. Razborov