What is the least number of different colours necessary to colour a map such that no region shares a border with another region of the same colour?

Think in terms of connected nodes and regional topology. Note that modern proofs are computer-aided, so most likely you'll reason or you've heard of this before.

×

Problem Loading...

Note Loading...

Set Loading...