Extremal problems on set systems
Random Structures & Algorithms
A Note on a Question of Erdös and Graham
Combinatorics, Probability and Computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
A variant of the hypergraph removal lemma
Journal of Combinatorial Theory Series A
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
SIAM Journal on Discrete Mathematics
On the removal lemma for linear systems over Abelian groups
European Journal of Combinatorics
Roth-type theorems in finite groups
European Journal of Combinatorics
| Hi-index | 0.00 |
Green [B. Green, A Szemeredi-type regularity lemma in abelian groups, with applications, Geom. Funct. Anal. 15 (2005) 340-376] established a version of the Szemeredi 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.