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

Unavoidable sets and reducibility are named and not explained

Both terms appear in the one-page summary of the proof I was given, with no definition of either. Without knowing what a reducible configuration is, the summary is just vocabulary. I would rather have seen one worked reducible configuration than the full list of proof milestones.
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.