Problem A. 577. (December 2012)
A. 577. Prove that if the edges of a k-chromatic graph are colored with two colors then there is a tree in the graph, containing k vertices, whose edges have the same colors.
Miklós Schweitzer Competition, 2012
Deadline expired on January 10, 2013.
4 students sent a solution. 5 points: Ágoston Péter, Omer Cerrahoglu. 0 point: 2 students.