Suppose we 2-colour the edges of the complete graph K_n. Show that there are two monochromatic paths P_1 and P_2 such that V(P_1) \cup V(P_2) = V(K_n).