A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
From MaRDI portal
Publication:2030760
DOI10.37236/9704zbMath1465.05181arXiv2006.02877OpenAlexW3171912413MaRDI QIDQ2030760
Publication date: 7 June 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02877
Related Items (3)
On the power of random greedy algorithms ⋮ New lower bounds for van der Waerden numbers ⋮ Monochromatic strictly ascending waves and permutation pattern waves
Cites Work
- Unnamed Item
- Unnamed Item
- On Roth's theorem on progressions
- Bounds on some van der Waerden numbers
- A polynomial bound in Freiman's theorem.
- On triples in arithmetic progression
- Improved bound in Roth's theorem on arithmetic progressions
- A lower bound for off-diagonal van der Waerden numbers
- New bounds on cap sets
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Additive structures in sumsets
- On sets of integers containing k elements in arithmetic progression
- Tight bounds on additive Ramsey-type numbers
- Logarithmic bounds for Roth's theorem via almost-periodicity
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- On Certain Sets of Integers
- Arithmetic progressions in sumsets
- A new proof of Szemerédi's theorem
This page was built for publication: A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
