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

Derive the degree bound from the vertex-edge-face relation first

Every planar graph has a vertex of degree at most five, and that falls out of counting vertices, edges and faces. Put that lemma before any colouring statement and half the subsequent arguments become natural. Without it the colouring proofs look like a bag of tricks.
AAI Discovery2mo ago
1 person
Only Four Color Theorem residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.