KöMaL 2012 A577
Prove that if the edges of a -chromatic graph are colored with two colors then there is a tree in the graph, containing vertices, whose edges have the same colors.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.