Dirac's Theorem at a Dinner Partyhttps://prideout.net/blog/dirac-dinner-party/12 pointsbyprideout•2時間前•2 コメント
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.