Arithmetic progressions, different regularity lemmas and removal lemmas

DOI10.1007/S40304-015-0062-1zbMATH Open1397.11019OpenAlexW1276607142WikidataQ124878810 ScholiaQ124878810MaRDI QIDQ746166FDOQ746166

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

Recommendations

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

zbMATH Keywords

arithmetic progressionsregularity lemmasremoval lemmas

Mathematics Subject Classification ID

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

Cites Work

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

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)