Theorem 1.3
(Finite Ramsey)
.
Assuming that:
r
≥
1
,
k
≥
1
,
m
≥
1
Then
there exists
n
∈
ℕ
such that whenever
[
n
]
(
r
)
is
k
-coloured, we can find a monochromatic set of size
m
.