10 comments

[ 3.4 ms ] story [ 24.4 ms ] thread
(comment deleted)
I skimmed it, but couldn't find what the "doodle theorem" is. It's only mentioned in the title.
Euler’s graph theorem.
Actually, no. That is mentioned, but it's not the theorem in question.
Quoting from the article:

> Claim: every doodle can be two-coloured.

(comment deleted)