asked 162k views
4 votes
I have the most difficult problem ever!! Prove the four-color theorem.

1 Answer

5 votes
The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not share the same color. This problem is sometimes also called Guthrie's problem after F. Gunthrie, who first conjectured the theorem in 1852. Hope this was helpful
answered
User Pygmalion
by
7.1k points

No related questions found

Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.