Roth-type theorems in finite groups

Authors:
József Solymosi
Affiliations:
-
Venue:
European Journal of Combinatorics
Year:
2013

Citing 6
Cited 0

On subsets of Abelian groups with no 3-term arithmetic progression

Journal of Combinatorial Theory Series A
Extremal problems on set systems

Random Structures & Algorithms
A Note on a Question of Erdös and Graham

Combinatorics, Probability and Computing
Regularity lemma for k-uniform hypergraphs

Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs

Random Structures & Algorithms
Note: A combinatorial proof of the Removal Lemma for Groups

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove Roth-type theorems in finite groups. Our main tool is the Triangle Removal Lemma of Ruzsa and Szemeredi.