Additive combinatorics and graph theory
Summary: 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 different graph theoretic results with various applications in additive combinatorics and computer science. Finally, we mention some elementary results in discrete geometry. For the entire collection see [Zbl 1396.00017].
scientific article; zbMATH DE number 6979409
scientific article