Skip to content

Comment on Mathematicians Solve Long-Standing Coloring Problemparent

Comments

Not in any straightforward way I can see. Some obvious differences:

- This result has effectively only two colours: "coloured" and "not coloured".

- This relates to an infinite continuous plane of points rather than a finite, discrete set.

- This has a notion of distance, whereas the four-colour theorem is more about connectivity.

That said, the idea of using a computer to aid a proof did also occur in the original proof of the four colour theorem.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.