A probabilistic threshold for monochromatic arithmetic progressions
From MaRDI portal
Publication:889513
DOI10.1016/j.jcta.2015.08.003zbMath1325.05176arXiv1206.2885OpenAlexW1855239393MaRDI QIDQ889513
Publication date: 6 November 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.2885
Cites Work
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Monochromatic progressions in random colorings
- Hypergraph containers
- A pseudo upper bound for the van der Waerden function
- Ramsey properties of random discrete structures
- Rado Partition Theorem for Random Subsets of Integers
- Threshold Functions for Ramsey Properties
- Independent sets in hypergraphs
- A new proof of Szemerédi's theorem
This page was built for publication: A probabilistic threshold for monochromatic arithmetic progressions