The famous four-color theorem states that one can color the vertices of any planar graph (so that adjacent vertices get different colors) with at most four colors. It had been conjectured for a long time and was eventually proved in 1976 by Appel and Haken. Can you color the complete graph K 5 with four colors? Does the result contradict
Chapter 23, PROBLEM SET 23.8 #24
The famous four-color theorem states that one can color the vertices of any planar graph (so that adjacent vertices get different colors) with at most four colors. It had been conjectured for a long time and was eventually proved in 1976 by Appel and Haken. Can you color the complete graph K5 with four colors? Does the result contradict the four-color theorem?
This problem has been solved!
Do you need an answer to a question different from the above? Ask your question!
Related Book For 
PROBLEM SET 23.2:
PROBLEM SET 23.4:
PROBLEM SET 23.5:
PROBLEM SET 23.6:
PROBLEM SET 23.7:
PROBLEM SET 23.8: