Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results gives a new proof of a theorem of Frankl and R

• Type: Journal
• Year: 2006
• Where: CPC
• Authors: W. T. Gowers
• Keywords: CPC 2006, Lemmas, Notable Consequence, Paper