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

Greedy colouring and the theorem got mixed together in my head

The course does greedy colouring with a degree bound, then states this theorem, and I left thinking the greedy method gives four colours on planar graphs. It does not. The bound you get that way is worse, and nothing in the lecture drew a line between the algorithm and the existence result.
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.