RU-239-OPEN 2015 Problem 3
The edges of a graph are coloured in two colours. Such that for each colour all the connected components of this graph formed by edges of this colour contains at most vertices. Prove there exists a proper colouring for the vertices of this graph with colours.
Dataset text AI-MO AoPS. 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.