Arithmetic progressions of length three in subsets of a random set
From MaRDI portal
Publication:4883030
DOI10.4064/aa-75-2-133-163zbMath0858.11009OpenAlexW1533996792WikidataQ97694931 ScholiaQ97694931MaRDI QIDQ4883030
Vojtěch Rödl, Tomasz Łuczak, Yoshiharu Kohayakawa
Publication date: 25 March 1997
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/206867
Density, gaps, topology (11B05) Arithmetic progressions (11B25) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Extremal combinatorics (05D99)
Related Items (35)
Finite configurations in sparse sets ⋮ Extremal subgraphs of random graphs ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Normal limiting distributions for systems of linear equations in random sets ⋮ Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers ⋮ Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ Mantel's theorem for random graphs ⋮ A new proof of the KŁR conjecture ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ Four‐term progression free sets with three‐term progressions in all large subsets ⋮ On zero-sum free sequences contained in random subsets of finite cyclic groups ⋮ Infinite Sidon Sets Contained in Sparse Random Sets of Integers ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ On the Number ofBh-Sets ⋮ Counting configuration-free sets in groups ⋮ On the KŁR conjecture in random graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ Counting configuration-free sets in groups ⋮ A weighted regularity lemma with applications ⋮ The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers ⋮ Counting sum-free sets in abelian groups ⋮ Random sum-free subsets of abelian groups ⋮ Regular pairs in sparse random graphs I ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets ⋮ What is good mathematics? ⋮ Roth's theorem in the Piatetski-Shapiro primes ⋮ Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers ⋮ Independent sets in hypergraphs ⋮ Counting independent sets in graphs ⋮ A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
This page was built for publication: Arithmetic progressions of length three in subsets of a random set
