News for hackers. Stuff that matters.

A comment on A Non-Constructive Proof of the Four Colour Theorem. Parent comment

Re:A Non-Constructive Proof of the Four Colour Theorem by bodhiandphysics on Wednesday December 21, 2022 @02:37PM (#34085379)
The graph has to be planar, which means no to edges intersect (or you can move the edges so that no two edges intersect). The complete graph with 5 or more vertices isn't planar.
[ Parent | on HN ]

There are no comments on this comment yet.