MathDB

3

Part of 1997 Kurschak Competition

Problems(1)

3-coloring, no one-color cycle

Source: Kürschák 1997, problem 3

7/15/2014
Prove that the vertices of any planar graph can be colored with 33 colors such that there is no monochromatic cycle.
combinatorics unsolvedcombinatorics