We prove that for every finite colouring of the set of unordered pairs of real numbers there is a set of reals homeomorphic to the rationals whose pairs use no more than two colours. This solves a problem of F. Galvin from the 1970's. The proof uses large cardinals. This is a joint work with Dilip Raghavan.