Szemerédi's lemma for the analyst

Geometric and Functional Analysis

Volumn 17, Issue 1, 2007, Pages 252-270

  Lovász, László ^a   Szegedy, Balázs ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Compactness; Cut norm; Limits of graph sequences; Regularity lemma

Indexed keywords

EID: 34247643254     PISSN: 1016443X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00039-007-0599-6     Document Type: Article

References (22)

1. N. Alon, E. Fischer, M. Krivelevich, M. Szegedy, Efficient testing of large graphs, Proc. 40th Ann. Symp. on Found. of Comp. Sci. IEEE (1999), 656-666.
2. N. ALON, E. FISCHER, M. KRIVELEVICH, M. SZEGEDY, Efficient testing of large graphs, Combinatorica 20 (2000), 451-476.
3. N. ALON, W. FERNANDEZ DE LA VEGA, R. KANNAN, M. KARPINSKI, Random sampling and approximation of MAX-CSPs, J. Comput. System Sci. 67 (2003), 212-243.
4. N. ALON, A. NAOR, Approximating the cut-norm via Grothendieck's inequality, Proc. of the 36 ACM STOC ACM Press (2004), 72-80.
5. N. ALON, A. SHAPIRA, Every monotone graph property is testable, Proc. of the 37 ACM STOC, Baltimore, ACM Press (2005), 128-137.
6. N. ALON, A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, Proc. of the 46 IEEE FOCS, IEEE (2005), 429-438.
7. C. BORGS, J. CHAYES, L. LOVÁSZ, Unique limits of dense graph sequences, manuscript.
8. C. BORGS, J. CHAYES, L. LOVÁSZ, V.T. SÓS, K. VESZTERGOMBI, Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, manuscript.
9. P. FRANKL, V. RÖDL, Extremal problems on set systems, Random Structures and Algorithms 20 (2002), 131-164.
10. A. FRIEZE, R. KANNAN, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
11. S. GERKE, A. STEGER, The sparse regularity lemma and its applications, in "Surveys in Combinatorics" (B.S. Webb, ed.), Cambridge Univ. Press (2005), 227-258.
12. O. GOLDREICH, S. GOLDWASSER, D. RON, Property testing and its connection to learning and approximation, J. ACM 45 (1998), 653-750.
13. W.T. GOWERS, Lower bounds of tower type for Szemerédi's uniformity lemma, GAFA, Geom. func. Anal. 7 (1997), 322-337.
14. W.T. GOWERS, Hypergraph regularity and the multidimensional Szemeredi theorem, manuscript.
15. Y. KOHAYAKAWA, V. RÖDL, Szemeŕdi's regularity lemma and quasi-randomness, in "Recent Advances in Algorithms and Combinatorics", CMS Books Math./Ouvrages Math. SMC 11, Springer, New York (2003), 289-351.
16. J. KOMLÓS, M. SIMONOVITS, Szemerédi's regularity lemma and its applications in graph theory, in "Combinatorics, Paul Erdos is Eighty (D. Miklos, et al., eds.), Bolyai Society Mathematical Studies 2 (1996), 295-352.
17. L. LOVÁSZ, B. SZEGEDY, Limits of dense graph sequences, MSR Tech. Report; ftp://ftp.research.microsoft.com/pub/tr/TR-2004-79. pdf
18. L. LOVÁSZ, B. SZEGEDY, Testing properties of graphs and functions, manuscript.
19. V. RÖDL, J. SKOKAN, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms 25 (2004), 1-42.
20. T.C. TAO, A variant of the hypergraph removal lemma, preprint; http://arxiv.org/abs/math.CO/0503572
21. T.C. TAO, Szemerédi's regularity lemma revisited, preprint; http://arxiv.org/abs/math.CO/0504472
22. D. WILLIAMS, Probability with Martingales, Cambridge Univ. Press, 1991.