Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 130 / 1 / ii

Pull the given finite coloring $\chi :\mathbb{N}\to [k]$ back to a finite coloring of unordered pairs by puttingThe ordering $a<b$ makes this a well-defined function on the edges of a complete graph. By Ramsey's theorem, some infinite set $X=\{x_1<x_2<\cdots \}$ has all its pairs of one color $r$ under $\tilde{\chi }$. ConsequentlyPossible coincidences between these products cause no difficulty, since the original finite coloring assigns each positive integer a single color.