arXiv:0804.4847 [math.CO]AbstractReferencesReviewsResources
A combinatorial proof of the Removal Lemma for Groups
Daniel Král', Oriol Serra, Lluís Vena
Published 2008-04-30Version 1
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his Removal Lemma that allows us to extend its statement to all finite groups. We also discuss possible extensions of the Removal Lemma to systems of equations.
Categories: math.CO
Related articles: Most relevant | Search more
On the Removal Lemma for Linear Systems over Abelian Groups
arXiv:1808.04975 [math.CO] (Published 2018-08-15)
A note on matchings in abelian groups
arXiv:1405.2603 [math.CO] (Published 2014-05-11)
A combinatorial proof that Schubert vs. Schur coefficients are nonnegative