four-color problem
[ fawr-kuhl-er, fohr- ]
/ ˈfɔrˈkʌl ər, ˈfoʊr- /
noun Mathematics.
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.
QUIZZES
BECOME A PRO CHEF WITH THIS EXQUISITE CUISINE QUIZ!
Even if you can't be a professional chef, you can at least talk like one with this vocabulary quiz.
Question 1 of 9
You may have read the word "simmer" in a recipe or two, but what does it really mean?
Also called four-color theorem.
Origin of four-color problem
First recorded in 1875–80
Words nearby four-color problem
four-by-two, four-channel, fourché, fourchette, four-color, four-color problem, four-colour, four-corners, four-cycle, four-deal bridge, four-dimensional
Dictionary.com Unabridged
Based on the Random House Unabridged Dictionary, © Random House, Inc. 2020