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

The statement takes one sentence and the proof cannot be read

I can explain to a ten year old what the theorem says. I cannot, as a graduate student, sit down and check the proof, because the case analysis is far past what a person can work through. That gap between statement and verification is the most interesting thing about this theorem and my course treated it as an embarrassment to be skipped.
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.