four colors always suffice to color any planar map · no two adjacent regions share a color · 1936 cases · runs locally
four color theorem (1976): any planar map can be colored with 4 colors so no adjacent regions match · proved by computer checking 1936 cases · no elegant proof known