# Edge colouring in K_n

Printable View

• Nov 29th 2010, 12:52 AM
Boysilver
Edge colouring in K_n
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)$.