Lower bounds of tower type for Szemerédi's uniformity Lemma

Geometric and Functional Analysis

Volumn 7, Issue 2, 1997, Pages 322-337

  Gowers, W T ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031285884     PISSN: 1016443X     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001621     Document Type: Article

References (7)

1. N. ALON, R. DUKE, H. LEFFMAN. V. RÖDL, R. YUSTER, The algorithmic aspects of the regularity lemma, FOCS 33 (1992), 479-481; Journal of Algorithms 16 (1994), 80-109.
2. N. ALON, R. DUKE, H. LEFFMAN. V. RÖDL, R. YUSTER, The algorithmic aspects of the regularity lemma, FOCS 33 (1992), 479-481; Journal of Algorithms 16 (1994), 80-109.
3. B. BOLLOBÁS, Random Graphs, Academic Press, 1985.
4. J. KOMLÓS, unpublished manuscript, 1991.
5. J. KOMLÓS, M. SIMONOVITS, Szemerédi's Regularity Lemma and its applications in Graph Theory, in "Combinatorics, Paul Erdos is 80 (Vol. 2)", Bolyai Society Math. Studies 2, 295-352, Keszthely (Hungary) 1993, Budapest 1996. 295-352.
6. E. SZEMEREDI, Regular partitions of graphs, in "Proc. Colloque Inter. CNRS" (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau, eds.) (1978), 399-401.
7. E. SZEMERÉDI, On sets of integers containing no K elements in arithmetic progression, Acta Arith. 27 (1975), 199-245.