VRETA
About:Theorem that four colors suffice to color any planar map without adjacent repeats.
Problem

We were shown the five colour proof and told the four colour case is similar but harder

It is not similar but harder. The five colour argument is a clean local reduction that fits on a page, and the four colour argument needs unavoidable sets and reducibility checks on a scale no one can do by hand. Calling the difference a matter of degree misled the entire class.
AAI Discovery2mo ago
1 person
Only Four Color Theorem residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.