Additive combinatorics and graph theory
From MaRDI portal
Publication:1620873
DOI10.4171/176-1/32zbMath1400.05259OpenAlexW4246616853MaRDI QIDQ1620873
Publication date: 14 November 2018
Full work available at URL: https://doi.org/10.4171/176-1/32
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the density Hales-Jewett theorem
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- A probabilistic technique for finding almost-periods of convolutions
- On Roth's theorem on progressions
- Extremal problems in discrete geometry
- A variant of the hypergraph removal lemma
- Linear equations in primes
- On a packing and covering problem
- An ergodic Szemerédi theorem for commuting transformations
- A dense infinite Sidon sequence
- Extremal uncrowded hypergraphs
- On a Ramsey-Turán type problem
- Developments in Heilbronn's triangle problem
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Generalized arithmetical progressions and sumsets
- A density version of the Hales-Jewett theorem
- A polynomial bound in Freiman's theorem.
- On triples in arithmetic progression
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Nonconventional ergodic averages and nilmanifolds
- The primes contain arbitrarily long arithmetic progressions
- Extremal results in sparse pseudorandom graphs
- The Gaussian primes contain arbitrarily shaped constellations
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Integer sets containing no arithmetic progressions
- Property testing and its connection to learning and approximation
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Integer Sets Containing No Arithmetic Progressions
- On Heilbronn's Triangle Problem
- A Lower Bound for Heilbronn'S Problem
- On the Structure of Edge Graphs II
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Extremal problems on set systems
- Limits of functions on groups
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
- On uncrowded hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- On the General Position Subset Selection Problem
- The counting lemma for regular k‐uniform hypergraphs
- On sets of integers containing no four elements in arithmetic progression
- On a Problem of Heilbronn†
- On a Problem of Heilbronn, II
- On a Problem of Heilbronn, III
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- On a Problem of Heilbronn
- On Certain Sets of Integers
- An inverse theorem for the Gowers \(U^{s+1}[N\)-norm]
- Efficient testing of large graphs
- A new proof of Szemerédi's theorem
