Additive combinatorics and graph theory
type: Item
instance of: scholarly article
title: Additive combinatorics and graph theory
zbMATH Open document ID: 1400.05259
DOI: 10.4171/176-1/32
publication date: 2018-11-14T00:00:00Z
review text: 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].
Mathematics Subject Classification ID: 05D10
Mathematics Subject Classification ID: 11B25
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 6979409
zbMATH Keywords: long arithmetic progressions
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.4171/176-1/32
OpenAlex ID: W4246616853
cites work: A dense infinite Sidon sequence
cites work: Extremal uncrowded hypergraphs
cites work: Q4059020
cites work: Efficient testing of large graphs
cites work: Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
cites work: On triples in arithmetic progression
cites work: On a Ramsey-Turán type problem
cites work: A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
cites work: On the Structure of Edge Graphs II
cites work: A polynomial bound in Freiman's theorem.
cites work: A probabilistic technique for finding almost-periods of convolutions
cites work: Extremal results in sparse pseudorandom graphs
cites work: A new proof of the density Hales-Jewett theorem
cites work: On uncrowded hypergraphs
cites work: Extremal problems on set systems
cites work: Nonconventional ergodic averages and nilmanifolds
cites work: Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
cites work: A density version of the Hales-Jewett theorem
cites work: An ergodic Szemerédi theorem for commuting transformations
cites work: A new proof of Szemerédi's theorem
cites work: Hypergraph regularity and the multidimensional Szemerédi theorem
cites work: Decompositions, approximate structure, transference, and the Hahn-Banach theorem
cites work: On Heilbronn's Triangle Problem
cites work: The primes contain arbitrarily long arithmetic progressions
cites work: Q3613910
cites work: NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
cites work: Linear equations in primes
cites work: An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
cites work: Q4430610
cites work: Property testing and its connection to learning and approximation
cites work: Integer Sets Containing No Arithmetic Progressions
cites work: A Lower Bound for Heilbronn'S Problem
cites work: The counting lemma for regular k‐uniform hypergraphs
cites work: On the General Position Subset Selection Problem
cites work: On a Problem of Heilbronn
cites work: On a Problem of Heilbronn, II
cites work: On a Problem of Heilbronn, III
cites work: Q5680714
cites work: Developments in Heilbronn's triangle problem
cites work: On Certain Sets of Integers
cites work: Regularity Lemma for k-uniform hypergraphs
cites work: On a packing and covering problem
cites work: Robust Characterizations of Polynomials with Applications to Program Testing
cites work: Generalized arithmetical progressions and sumsets
cites work: Q4175585
cites work: On Roth's theorem on progressions
cites work: On a Problem of Heilbronn†
cites work: Q5692730
cites work: Limits of functions on groups
cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry
cites work: On sets of integers containing no four elements in arithmetic progression
cites work: Q4200109
cites work: Q4401979
cites work: Integer sets containing no arithmetic progressions
cites work: Extremal problems in discrete geometry
cites work: A variant of the hypergraph removal lemma
cites work: The Gaussian primes contain arbitrarily shaped constellations
cites work: The inverse conjecture for the Gowers norm over finite fields in low characteristic
cites work: Q5393666
cites work: A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
author: Endre Szemerédi
Recommended article: Q4873739
Recommended article: Q3653943
Recommended article: Q5393666
Recommended article: Q5308103

Additive combinatorics and graph theory (Recommended article)
Recommended article: Q3508462
Similarity Score: 0.9392917
Recommender Run: Recommender Run 3

Additive combinatorics and graph theory (Recommended article)
Recommended article: Q4950461
Similarity Score: 0.93929154
Recommender Run: Recommender Run 3

Additive combinatorics and graph theory (Recommended article)
Recommended article: Graph Theory and Additive Combinatorics
Similarity Score: 0.9259714
Recommender Run: Recommender Run 3

Additive combinatorics and graph theory (Recommended article)
Recommended article: Structure theorems in additive combinatorics
Similarity Score: 0.92015886
Recommender Run: Recommender Run 3

Additive combinatorics and graph theory (Recommended article)
Recommended article: An application of graph theory to additive number theory
Similarity Score: 0.9173132
Recommender Run: Recommender Run 3