Question 76
A graph has $2016$ vertices. All the edges of the graph are coloured blue or red. It is known that the graph contains no blue path on $1062$ vertices. Prove that it is possible to select two disjoint sets of $477$ vertices each, such that all the edges between these sets are red.