A sharp threshold for van der Waerden's theorem in random subsets
From MaRDI portal
Publication:2826230
DOI10.19086/da.615zbMath1346.05270arXiv1512.05921OpenAlexW3103482493MaRDI QIDQ2826230
Yury Person, Mathias Schacht, Hiệp Hàn, Ehud Friedgut
Publication date: 10 October 2016
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05921
Related Items (6)
Hypercontractivity for global functions and sharp thresholds ⋮ An asymmetric random Rado theorem for single equations: The 0‐statement ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Random Van der Waerden theorem ⋮ An asymmetric random Rado theorem: 1-statement
Cites Work
- Combinatorial theorems in sparse random sets
- On the KŁR conjecture in random graphs
- Hypergraph containers
- Ramsey properties of random discrete structures
- On Certain Sets of Positive Density
- A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
- Sharp thresholds of graph properties, and the $k$-sat problem
- Rado Partition Theorem for Random Subsets of Integers
- Sharp thresholds for certain Ramsey properties of random graphs
- Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs
- Hunting for sharp thresholds
- Threshold Functions for Ramsey Properties
- Independent sets in hypergraphs
This page was built for publication: A sharp threshold for van der Waerden's theorem in random subsets