2 ms·
The 4 colour theorem is about colouring an arbitrary planar graph such that adjacent vertices have different colours. The problem posed here is about colouring
by cperciva 17y ago
The 4 colour theorem is about colouring an arbitrary planar graph such that adjacent vertices have different colours.
The problem posed here is about colouring a 17x17 grid such that there is no monochromatic rectangle.
These problems have nothing in common aside from the word "colouring" and the number "4".