MathDB
ARO 2011 10-3

Source:

April 26, 2011
combinatorics proposedcombinatoricsgraph theory

Problem Statement

The graph GG is not 33-coloured. Prove that GG can be divided into two graphs MM and NN such that MM is not 22-coloured and NN is not 11-coloured.
V. Dolnikov
Back to ProblemsView on AoPS