Hales-Jewett theorem
= Hales-Jewett theorem
{c}
{wiki=Hales–Jewett_theorem}
For every finite alphabet $X$ and every positive integer $k$, there is $n$ such that every $k$-coloring of $X^n$ contains a monochromatic <combinatorial line>.
= Hales-Jewett theorem
{c}
{wiki=Hales–Jewett_theorem}
For every finite alphabet $X$ and every positive integer $k$, there is $n$ such that every $k$-coloring of $X^n$ contains a monochromatic <combinatorial line>.