Additive combinatorics and graph theory
Endre SzemerédiHungarian Academy of Sciences, Budapest, Hungary
Download Chapter PDF
A subscription is required to access this book chapter.
In this survey we mainly discuss the conditions for a set to contain long arithmetic progressions. We mention the ergodic, Fourier analytic and combinatorial approach to provide such conditions. In addition we describe defferent graph theoretic results with various applications in additive combinatorics and computer science. Finally, we mention some elementary results in discrete geometry.