113 citations · 148 across the 13 of their papers we have counts for
Showing 2003 · math.COShow all
3 papers · 2 filters
math.CO2003★ 113 cited
A Szemeredi-type regularity lemma in abelian groups, with applications
Ben Green
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemm…
math.CO2003★ 3 cited
Sum-free sets in abelian groups
Ben Green, Imre Z. Ruzsa
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the larges…
math.CO2003
Counting sets with small sumset, and the clique number of random Cayley graphs
Ben Green
Given a set A in Z/NZ we may form a Cayley sum graph G_A on vertex set Z/NZ by joining i to j if and only if i + j is in A. We investigate the extent to which performing this const…