COMBINATORIAL AND ERGODIC APPROACHES TO SZEMERÉDI 3 where

@inproceedings{Tao2006COMBINATORIALAE,
  title={COMBINATORIAL AND ERGODIC APPROACHES TO SZEMER{\'E}DI 3 where},
  author={Terence Tao},
  year={2006}
}
A famous theorem of Szemerédi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality , we know of four types of arguments that can prove this theorem: the original combinatorial (and graph-theoretical) approach of Szemerédi, the ergodic theory approach of Furstenberg, the… CONTINUE READING