A van der Waerden number is the least threshold in the finite form of van der Waerden's theorem. This
theorem states that for all positive integers and , there exists a positive integer such that, for every integer, if , then
some set contains an arithmetic
progression of length . The least possible value of is known as a van der Waerden number. The elementary
values are ,
,
and .
Nontrivial values are summarized in the following table (Kouril 2012, p. 2).
As shown in the table, the first few values of for , 2, ... are 1, 3, 9, 35, 178, 1132, ... (OEIS A005346),
the last of which is due to Kouril and Paul (2008).
For explicit numerical lower bounds, Kim (2026) constructed colorings giving and . Kim (2026) also gave improved
three-color lower bounds for every progression length
from 9 through 28, compared with the published bounds considered there. These finite
constructions do not improve the asymptotic growth rate.
The growth question for two colors is problem 138 in the Erdős problems collection. Writing , it asks in particular whether as (Bloom 2026).
Berlekamp, E. R. "A Construction for Partitions Which Avoid Long Arithmetic Progressions." Canad. Math. Bull.11,
409-414, 1968. https://doi.org/10.4153/CMB-1968-047-7.Bloom,
T. "Erdős Problem #138." Accessed Oct. 26, 2026. https://www.erdosproblems.com/138.Goodman,
J. E. and O'Rourke, J. (Eds.). Handbook
of Discrete & Computational Geometry. Boca Raton, FL: CRC Press, p. 159,
1997.Gowers, W. T. "Fourier Analysis and Szemerédi's
Theorem." In Proceedings of the International Congress of Mathematicians,
Vol. 1.Doc. Math. 1998, Extra Vol. 1. Berlin, Germany, pp. 617-629,
1998. https://doi.org/10.4171/DMS/1-1/23.Gowers,
W. T. "A New Proof of Szemerédi's Theorem for Arithmetic Progressions
of Length Four." Geom. Funct. Anal.8, 529-551, 1998.Gowers,
W. T. "A New Proof of Szemerédi's Theorem." Geom. Funct.
Anal.11, 465-588, 2001. https://doi.org/10.1007/s00039-001-0332-9.Heule,
M. J. H. "Improving the Odds: New Lower Bounds for Van der Waerden
Numbers." March 4, 2008. http://www.st.ewi.tudelft.nl/sat/slides/waerden.pdf.Honsberger,
R. More
Mathematical Morsels. Washington, DC: Math. Assoc. Amer., p. 29, 1991.Kim,
S. "Polychromatic Blocks and Explicit Lower Bounds for Multicolour van der Waerden
Numbers." 22 Oct 2026. https://arxiv.org/abs/2610.32000.Kouril,
M. "Computing the van der Waerden Number ." Integers12, A46, 2012. https://math.colgate.edu/~integers/m46/m46.pdf.Kouril,
M. and Paul, J. L. "The van der Waerden Number W(2,6) Is 1132." Experimental
Math.17, 53-61, 2008.Shelah, S. "Primitive Recursive
Bounds for van der Waerden Numbers." J. Amer. Math. Soc.1, 683-697,
1988.Sloane, N. J. A. Sequence A005346/M2819
in "The On-Line Encyclopedia of Integer Sequences."