Arithmetic progressions, different regularity lemmas and removal lemmas

DOI10.1007/S40304-015-0062-1MaRDI QIDQ746166zbMATH OpenOpenAlexWikidataFDO

Authors Endre Szemerédi

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

zbMATH Keywords

arithmetic progressionsregularity lemmasremoval lemmas

Mathematics Subject Classification ID

Hypergraphs (05C65) Arithmetic progressions (11B25) Extremal combinatorics (05D99)

Recommendations

• Szemerédi's regularity lemma revisited
• Graph removal lemmas
• Regularity lemmas for graphs
• Regularity, uniformity, and quasirandomness
• scientific article; zbMATH DE number 2086426

Cites work

• scientific article; zbMATH DE number 5528961 (Why is no real title available?)
• scientific article; zbMATH DE number 3523693 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3435529 (Why is no real title available?)
• scientific article; zbMATH DE number 2209746 (Why is no real title available?)
• A density version of the Hales-Jewett theorem
• A measure-theoretic approach to the theory of dense hypergraphs
• A new proof of Szemerédi's theorem
• An ergodic Szemerédi theorem for commuting transformations
• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• Efficient testing of large graphs
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Extremal problems on set systems
• Extremal results in sparse pseudorandom graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Integer Sets Containing No Arithmetic Progressions
• Integer sets containing no arithmetic progressions
• New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
• On Certain Sets of Integers
• On Roth's theorem on progressions
• On a Ramsey-Turán type problem
• On sets of integers containing no four elements in arithmetic progression
• On the Structure of Edge Graphs II
• On the number of 3-edge colorings of cubic graphs
• On triples in arithmetic progression
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Property testing and its connection to learning and approximation
• Regularity Lemma for k-uniform hypergraphs
• Robust Characterizations of Polynomials with Applications to Program Testing
• The counting lemma for regular k‐uniform hypergraphs
• The inverse conjecture for the Gowers norm over finite fields in low characteristic
• The primes contain arbitrarily long arithmetic progressions

Cited in

(3)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
• Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth

This page was built for publication: Arithmetic progressions, different regularity lemmas and removal lemmas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746166)