Arithmetic progressions, different regularity lemmas and removal lemmas
From MaRDI portal
Publication:746166
DOI10.1007/s40304-015-0062-1zbMath1397.11019OpenAlexW1276607142WikidataQ124878810 ScholiaQ124878810MaRDI QIDQ746166
Publication date: 16 October 2015
Published in: Communications in Mathematics and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40304-015-0062-1
Related Items
Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- A measure-theoretic approach to the theory of dense hypergraphs
- On Roth's theorem on progressions
- An ergodic Szemerédi theorem for commuting transformations
- On a Ramsey-Turán type problem
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- On the number of 3-edge colorings of cubic graphs
- A density version of the Hales-Jewett theorem
- On triples in arithmetic progression
- The primes contain arbitrarily long arithmetic progressions
- Extremal results in sparse pseudorandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Integer sets containing no arithmetic progressions
- Property testing and its connection to learning and approximation
- Integer Sets Containing No Arithmetic Progressions
- On the Structure of Edge Graphs II
- Extremal problems on set systems
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
- Regularity Lemma for k-uniform hypergraphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- The counting lemma for regular k‐uniform hypergraphs
- On sets of integers containing no four elements in arithmetic progression
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- 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
