Quasirandomness, counting and regularity for 3-uniform hypergraphs

Combinatorics Probability and Computing

Volumn 15, Issue 1-2, 2006, Pages 143-184

  Gowers, W T ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; RANDOM PROCESSES; THEOREM PROVING;

ARITHMETIC PROGRESSION; HYPERGRAPHS; QUASIRANDOMNESS;

GRAPH THEORY;

EID: 29744456824     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548305007236     Document Type: Article

References (16)

1. Chung, F. R. K. and Graham, R. L. (1990) Quasi-random hypergraphs. Random Struct. Alg. 1 105-124.
2. n. J. Combin. Theory Ser. A 61 64-86.
3. Chung, F. R. K., Graham, R. L. and Wilson, R. M. (1989) Quasi-random graphs. Combinatorica 9 345-362.
4. Frankl, P. and Rödl, V. (1992) The uniformity lemma for hypergraphs. Graphs Combin. 8 309-312.
5. Frankl, P. and Rödl, V. (2002) Extremal problems on set systems. Random Struct. Alg. 20 131-164.
6. Furstenberg, H. and Katznelson, Y. (1978) An ergodic Szemerédi theorem for commuting transformations. J. Analyse Math. 34 275-291.
7. Furstenberg, H., Katznelson, Y. and Ornstein, D. (1982) The ergodic theoretical proof of Szemerédi's theorem Bull. Amer. Math. Soc. 7 527-552.
8. Gowers, W. T. (1998) A new proof of Szemerédi's theorem for arithmetic progressions of length four. Geom. Funct. Anal. 8 529-551.
9. Gowers, W. T. (2001) A new proof of Szemerédi's theorem. Geom. Funct. Anal. 11 465-588.
10. Gowers, W. T. Hypergraph regularity and Szemerédi's theorem. Submitted.
11. Nagle, B., Rödl, V. and Schacht, M. The counting lemma for regular k-uniform hypergraphs. Random Struct. Alg., to appear.
12. Rödl, V. (1991) Some developments in Ramsey theory. In Proc. International Congress of Mathematicians, Vol. I, II (Kyoto, 1990), Math. Soc. Japan, Tokyo, pp. 1455-1466.
13. Ruzsa, I. Z. and Szemerédi, E. (1978) Triple systems with no six points carrying three triangles. In Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, pp. 939-945.
14. Solymosi, J. (2003) Note on a generalization of Roth's theorem. In Discrete and Computational Geometry, Vol. 25 of Algorithms and Combinatorics, Springer, Berlin, pp. 825-827.
15. Solymosi, J. (2004) A note on a question of Erdos and Graham. Combin. Probab. Comput. 13 263-267.
16. Thomason, A. G. (1987) Pseudo-random graphs. In Proc. Random Graphs, Poznán 1985 (M. Karonski, ed.), Ann. Discrete Math. 33 307-331.