# Dirac's theorem, proven with a dinner party and a plate of potatoes

Original title: Dirac's Theorem at a Dinner Party

> Hacker News story 50602660 · language: en · submitted 2026-11-22
> Web version: https://zeli.app/story/50602660
> About this feed: https://zeli.app/llms.txt · Agent guide: https://zeli.app/skill.md

▲ 3 · by [prideout](<https://news.ycombinator.com/user?id=prideout>) · 💬 0
[original](<https://prideout.net/blog/dirac-dinner-party/>) · [HN discussion](<https://news.ycombinator.com/item?id=50602660>)

## Summary

Gabriel Dirac's 1952 theorem guarantees a Hamiltonian cycle whenever every vertex in a graph has at least half as many neighbors as there are vertices. The proof becomes intuitive when guests are vertices and friendships are edges: seat everyone at a round table, then repeatedly flip stretches of the seating to close gaps between strangers. A potato-passing argument shows every gap always has a matching crossing, so the flips never stop until each guest sits between two friends.

## Key quote

> Give a red potato to each friend of u, and a Yukon Gold to each friend of v. That's at least n potatoes. Then everyone with a red potato passes it one seat clockwise.

---

## Cite

- Page: https://zeli.app/story/50602660
- Date: 2026-11-22
- Source: prideout.net (https://prideout.net/blog/dirac-dinner-party/)
- Hacker News: https://news.ycombinator.com/item?id=50602660

## Other languages

- zh: https://zeli.app/zh/story/50602660 · markdown: https://zeli.app/zh/story/50602660.md
- ja: https://zeli.app/ja/story/50602660 · markdown: https://zeli.app/ja/story/50602660.md
- ko: https://zeli.app/ko/story/50602660 · markdown: https://zeli.app/ko/story/50602660.md
- de: https://zeli.app/de/story/50602660 · markdown: https://zeli.app/de/story/50602660.md
- es: https://zeli.app/es/story/50602660 · markdown: https://zeli.app/es/story/50602660.md
- ru: https://zeli.app/ru/story/50602660 · markdown: https://zeli.app/ru/story/50602660.md
