As far as I know, there is a "proof" of the 4 color map theorem, but it requires the use of a computer to analyze about a 1,000 different scenarios, so its hard to check, unintuitive, and "not elegant."
Re:Mathematical embarrassments are problems that should be s...
by mquander on Monday December 28, 2009 @03:05AM
(#1018316)
This is not the problem described by the post you are responding to. Search for "chromatic number of the plane" or "Hadwiger-Nelson problem" to find clarification.
http://en.wikipedia.org/wiki/Five_color_theorem
As far as I know, there is a "proof" of the 4 color map theorem, but it requires the use of a computer to analyze about a 1,000 different scenarios, so its hard to check, unintuitive, and "not elegant."