Theorem 1.11
(The Hales-Jewett Theorem)
.
Assuming that:
m
,
k
∈
ℕ
Then
there exists
n
such that whenever we
k
-colour
[
m
]
n
there exists a monochromatic
combinatorial line
.