Intermediate
Discrete Mathematics & Math
Q59 / 100
What is the four color theorem?
Correct! Well done.
Incorrect.
The correct answer is B) Every planar graph can be properly colored with at most 4 colors (proved by computer in 1976, first major computer-assisted proof)
B
Correct Answer
Every planar graph can be properly colored with at most 4 colors (proved by computer in 1976, first major computer-assisted proof)
Explanation
4CT (Appel & Haken 1976): any planar map can be 4-colored. Also proved by Robertson, Sanders, Seymour, Thomas (1996). Notorious for requiring computer case-checking of 1,476 configurations.
Progress
59/100