A combinatorial proof of the Removal Lemma for Groups

Journal of Combinatorial Theory. Series A

Volumn 116, Issue 4, 2009, Pages 971-978

  Král', Daniel ^a   Serra, Oriol ^b   Vena, Lluís ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Group Removal Lemma; Removal Lemma

Indexed keywords

EID: 63249123198     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2008.12.003     Document Type: Article

References (18)

1. Alon N., and Shapira A. Testing subgraphs in directed graphs. J. Comput. System Sci. 69 (2004) 354-382
2. Biggs N. Algebraic Graph Theory (1974), Cambridge Univ. Press, Cambridge
3. P. Candela, On systems of linear equations and uniform hypergraphs, manuscript
4. Frankl P., and Rödl V. Extremal problems on set systems. Random Structures Algorithms 20 (2002) 131-164
5. Gowers W.T. Hypergraph regularity and the multidimensional Szemerédi theorem. manuscript available at:. arXiv:0710.3032v1
6. Green B. A Szemerédi-type regularity lemma in abelian groups, with applications. Geom. Funct. Anal. 15 (2005) 340-376
7. Komlós J., and Simonovits M. Szemerédi's regularity lemma and its applications in graph theory. Combinatorics, Paul Erdo{combining double acute accent}s is Eighty, vol. 2. Keszthely, 1993. Bolyai Soc. Math. Stud. vol. 2 (1996), János Bolyai Math Soc., Budapest 295-352
8. Král' D., Serra O., and Vena L. A removal lemma for systems of linear equations over finite fields. manuscript available at:. arXiv:0809.1846
9. Liebchen C. Finding short integral cycle bases for cyclic timetabling. In: Battista G., and Zwick U. (Eds). Proc. ESA'03. Lecture Notes in Comput. Sci. vol. 2832 (2003), Springer 715-726
10. C. Liebchen, L. Peeters, On cyclic timetabling and cycles in graphs, Technical Report 761/2002, TU Berlin, 2002
11. Nagle B., Rödl V., and Schacht M. The counting lemma for regular k-uniform hypergraphs. Random Structures Algorithms 28 (2006) 113-179
12. Roth K.F. On certain sets of integers. J. Lond. Math. Soc. 28 (1953) 104-109
13. Ruzsa I., and Szemerédi E. Triple systems with no six points carrying three triangles. Colloq. Math. Soc. J. Bolyai 18 (1978) 939-945
14. Shapira A. A proof of Green's conjecture regarding the removal properties of sets of linear equations. manuscript available at:. arXiv:0807.4901v2
15. Solymosi J. A note on a question of Erdo{combining double acute accent}s and Graham. Combin. Probab. Comput. 13 (2004) 263-267
16. Szegedy B. The symmetry preserving removal lemma. manuscript available at:. arXiv:0809.2626v1
17. Szemerédi E. Regular partitions of graphs. Problèmes combinatoires et théorie des graphes, Colloq. Internat. CNRS. Univ. Orsay, Orsay, 1976. Colloq. Internat. CNRS vol. 260 (1978), Paris 399-401
18. Tao T. A variant of the hypergraph removal lemma. J. Combin. Theory Ser. A 113 (2006) 1257-1280