Additive combinatorics and graph theory (Q1620873)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6979409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Additive combinatorics and graph theory |
scientific article; zbMATH DE number 6979409 |
Statements
Additive combinatorics and graph theory (English)
0 references
14 November 2018
0 references
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].
0 references
long arithmetic progressions
0 references
0 references
0.9259714
0 references
0.92015886
0 references
0.9173132
0 references
