Edge colouring in K_n

Printable View

November 28th 2010, 11:52 PM
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)$ .

All times are GMT -8. The time now is 07:31 AM.

Copyright © 2005-2013 Math Help Forum. All rights reserved.

Copyright © 2005-2013 Math Help Forum. All rights reserved.