228

On sets of integers containing no k elements in arithmetic progression
–
 1975

100

Additive Combinatorics
–
 2006

136

A NEW PROOF OF SZEMERÉDI’S THEOREM
–
 2001

151

The primes contain arbitrarily long arithmetic progressions
–

67

Regularity lemma for kuniform hypergraphs, Random Structures and Algorithms
–
 2004

66

The counting lemma for regular kuniform hypergraphs
–
 2004

94

Hypergraph regularity and the multidimensional Szemerédi theorem, manuscript
–
 2006

47

A variant of the hypergraph removal lemma
–
 2006

160

Efficient Testing of Large Graphs
–

18

The GreenTao Theorem on arithmetic progressions in the primes: an ergodic point of view
–
 2005

138

Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions
–
 1977

143

Regular partitions of graphs, in: Problèmes combinatoires et théorie des graphes
–
 1978

51

On sets of integers containing no four elements in arithmetic progression
–
 1969

43

counting and regularity for 3uniform hypergraphs
–

140

On certain sets of integers
–
 1953

5

Generalising the HardyLittlewood method for primes
–
 2007

348

SelfTesting/Correcting with Applications to Numerical Problems
–
 1990

82

On some sequences of integers
–
 1936

7

Ramsey numbers for boundeddegree hypergraphs, preprint, arXiv:math/0612601v1 [math.CO
–
