Hacker News

Dirac's Theorem at a Dinner Party

10 points by prideout ago | 2 comments

jonahx |next [-]

This is really nicely done.

The visualizations make the "flip" part of the argument immediately clear.

For the potato part, for me, an abstract verbal argument is clearer:

For any gap (u,v), mark all v neighbors, and all clockwise successors of all u neighbors.

n marks are now distributed among n-1 vertices (since v can't be marked). By pigeonhole, some vertex has 2 marks.

pepy07 |previous [-]

This is a really clever way of demonstrating Dirac's theorem.