The Solution of the Four-Color-Map Problem

Four colors suffice to color any planar map so that no two adjacent countries are the same color. This famous conjecture has been proved true by a new kind of proof, one that relies on high-speed computers