Bounds on some van der Waerden numbers
From MaRDI portal
Publication:958741
DOI10.1016/j.jcta.2008.01.005zbMath1169.05047arXiv0706.4420OpenAlexW2081918372MaRDI QIDQ958741
Aaron Robertson, Bruce M. Landman, Thomas C. Brown
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.4420
Related Items
New lower bounds for van der Waerden numbers, A new lower bound for van der Waerden numbers, On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\), A lower bound for off-diagonal van der Waerden numbers, A subexponential upper bound for van der Waerden numbers \(W(3,k)\), Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
Cites Work
- A new method to construct lower bounds for van der Waerden numbers
- Satisfiability and computing van der Waerden numbers
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item