Hales–Jewett theorem
For every finite alphabet and number of colors, sufficiently high-dimensional words over that alphabet contain a monochromatic combinatorial line under any coloring.
For every finite alphabet and number of colors, sufficiently high-dimensional words over that alphabet contain a monochromatic combinatorial line under any coloring.