Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive
The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has a monochromatic arithmetic progression of length k. The existence of such an n for any k is due to van der Waerden but known upper bounds on W(k,2) are enormous. Much effort was put into developing l...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Electronic Journal of Combinatorics
2014
|
| Online Access: | http://hdl.handle.net/1721.1/89798 https://orcid.org/0000-0003-3381-0459 |