Author |
Topic: R(C_2m, C_2m, C_2m) (Read 626 times) |
|
Aryabhatta
Uberpuzzler
Gender:
Posts: 1321
|
|
R(C_2m, C_2m, C_2m)
« on: Jun 8th, 2007, 2:47pm » |
Quote Modify
|
Supposedly this problem appeared in Vietnamese Maths Olympiad. Find the largest n, such that : There is a three colouring of the edges of the complete graph Kn on n vertices with no monochromatic cycle of even length.
|
« Last Edit: Jun 8th, 2007, 2:50pm by Aryabhatta » |
IP Logged |
|
|
|
Aryabhatta
Uberpuzzler
Gender:
Posts: 1321
|
|
Re: R(C_2m, C_2m, C_2m)
« Reply #1 on: Jun 17th, 2007, 11:24am » |
Quote Modify
|
Hint: Show that any simple graph on n vertices and more than [3(n-1)/2] edges has an even cycle
|
|
IP Logged |
|
|
|
|