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

Planarity is the whole hypothesis and it is mentioned in passing

The theorem is about graphs that can be drawn in the plane without crossings, and that restriction is doing all the work. In my notes it appears as an adjective in the statement and never again. On a torus you need seven colours, which would make the point instantly if anyone said it.
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.