four-color problem

[ fawr-kuhl-er, fohr- ]

noun

, Mathematics.

1. the problem, solved in 1976, of proving the theorem that any geographic map can be colored using only four colors so that no connected countries with a common boundary are colored the same color.

Word History and Origins

Origin of four-color problem¹

First recorded in 1875–80