Discrete Math Seminar

Van der Waerden's theorem states that any coloring of $\mathbb{N}$ with a finite number of colors will contain arbitrarily long monochromatic arithmetic progressions. This motivates the definition of the van der Waerden number $W(r,k)$ which is the smallest $n$ such that any $r$-coloring of $\{1,2,\cdots ,n\}$ guarantees the presence of a monochromatic arithmetic progression of length …