The First Nontrivial Hales-Jewett Number is Four

Abstract

We show that whenever the length four words over a three letter alphabet are two-colored, there must exist a monochromatic combinatorial line. We also provide some computer generated lower bounds for some other Hales-Jewett numbers.