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

Colouring exercises never leave five-vertex graphs

Every exercise I was set could be coloured by inspection, so I never felt the need for a theorem. Nothing in the problem set shows why colouring is hard, or why deciding three-colourability is a different animal from four-colouring a planar graph. The exercises taught me the vocabulary and none of the difficulty.
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.