Arithmetic progressions of length three in subsets of a random set

DOI10.4064/AA-75-2-133-163zbMATH Open0858.11009OpenAlexW1533996792WikidataQ97694931 ScholiaQ97694931MaRDI QIDQ4883030FDOQ4883030

Authors: Yoshiharu Kohayakawa, Tomasz Łuczak, Vojtěch Rödl 

Publication date: 25 March 1997

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/206867

Recommendations

• On the structure of sets with few three-term arithmetic progressions
• Maximal arithmetic progressions in random subsets
• Three-term arithmetic progressions and sumsets
• On the distribution of three-term arithmetic progressions in sparse subsets of \(\mathbb F_p^n\)
• Arithmetic subsequences in a random ordering of an additive set
• Arithmetic progressions of length three in multiplicative subgroups of \(\mathbb{F}_p \)
• Arithmetic progressions in sums of subsets of sparse sets
• On the structure of steps of three-term arithmetic progressions in a dense set of integers
• On the maximal number of 3-term arithmetic progressions in subsets of ℤ/p ℤ
• The maximal number of 3-term arithmetic progressions in finite sets in different geometries

zbMATH Keywords

Szemeredi regularity lemmathree term arithmetic progression

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Extremal combinatorics (05D99) Density, gaps, topology (11B05) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)

Cited In (47)

• Arithmetic subsequences in a random ordering of an additive set
• On the distribution of three-term arithmetic progressions in sparse subsets of \(\mathbb F_p^n\)
• A uniform set with fewer than expected arithmetic progressions of length 4
• Independent sets in hypergraphs
• Mantel's theorem for random graphs
• Combinatorial theorems in sparse random sets
• Extremal results for random discrete structures
• Counting independent sets in graphs
• A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
• \(K_4\)-free subgraphs of random graphs revisited
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• Finite configurations in sparse sets
• Tower-type bounds for Roth's theorem with popular differences
• Random sum-free subsets of abelian groups
• On zero-sum free sequences contained in random subsets of finite cyclic groups
• A weighted regularity lemma with applications
• The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
• On the stability of the Erdős-Ko-Rado theorem
• Almost disjoint families of 3-term arithmetic progressions
• Title not available (Why is that?)
• A distributive lattice connected with arithmetic progressions of length three
• Regular pairs in sparse random graphs I
• Counting configuration-free sets in groups
• Arithmetic structures in random sets
• Thick subsets that do not contain arithmetic progressions
• A new proof of the KŁR conjecture
• Normal limiting distributions for systems of linear equations in random sets
• Roth's theorem in the Piatetski-Shapiro primes
• Online containers for hypergraphs, with applications to linear equations
• The typical structure of sparse \(K_{r+1}\)-free graphs
• Title not available (Why is that?)
• On the number of \(B_h\)-sets
• An analytic approach to sparse hypergraphs: hypergraph removal
• On \(K^ 4\)-free subgraphs of random graphs
• On the KŁR conjecture in random graphs
• Counting configuration-free sets in groups
• Bivariate fluctuations for the number of arithmetic progressions in random sets
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Counting sum-free sets in abelian groups
• What is good mathematics?
• Four‐term progression free sets with three‐term progressions in all large subsets
• On Two-Point Configurations in a Random Set
• Three-term arithmetic progressions and sumsets
• Infinite Sidon sets contained in sparse random sets of integers
• Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
• Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
• Extremal subgraphs of random graphs

This page was built for publication: Arithmetic progressions of length three in subsets of a random set

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