Gabriel Dirac (the celebrated chart theorist) was the stepson of Paul Dirac (the equal additional celebrated physicist). Paul Dirac spent the final years of his occupation at Florida State University, and my begetter took his way in General Relativity in the 1970s.
Gabriel formulated an crucial theorem concerning Hamiltonian cycles. In this article I desire to provision a refresher on Hamiltonian cycles, and go complete a fun evidence of his theorem that involves a hypothetical meal party.
Over the way of multiple decades, Dirac’s theorem was improved whenever mathematicians formulated akin theorems that activity alongside a broader range of graphs. In the following figure, all theorem is additional broad than the one to its left. Each chart meets its own theorem’s condition, but none of the ones to its left, and its Hamiltonian sequence is blue.
Why am I penning concerning Dirac’s Theorem? Well, I wanted to compose concerning a uncomplicated evidence relating to Hamiltonian cycles as prep for my next post, which volition be concerning Barnette’s Conjecture, one of my favorite chart theory conjectures. It got promoted to a theorem in the 6-Oct-2026 Mathocalypse. In my next article I’ll conversation additional concerning that.
A Hamiltonian cycle is a stroll alongside the edges of a chart that visits all vertex exactly formerly and ends up rear anywhere it started. A chart that has one is Hamiltonian.
Hamiltonian cycles are connected to the Traveling Salesman Problem (e.g. designing shipment routes for Amazon packages). But my individual favorite use is an old-school device graphics problem: stated a triangle mesh, can you render it using a sole triangle strip?
Intuitively, it have to be easier to discover a Hamiltonian sequence in a chart that has many of edges related to its vertex count. In a way, that intuition is what Dirac formalized:
If a uncomplicated chart has vertices, and all vertex has at smallest neighbors, afterward the chart has a Hamiltonian cycle.
The following fig shows a random chart alongside 10 vertices, anywhere all vertex has exactly 5 neighbors, so the theorem guarantees a Hamiltonian cycle. On the right, the identical chart has been rearranged so that its Hamiltonian sequence runs about the outside…like a circular meal table.
1. Dinner party
To see why the theorem is true, archetypal ideate a gathering anywhere all visitant is a vertex and all companionship is an edge. Friendship goes the two ways, and nobody is their own friend, which is what simple method in chart theory. A Hamiltonian sequence is a way to place everyone at a circular array so that all visitant sits between two friends:
If a gathering has guests, and all visitant is allies alongside at smallest of the others, afterward the guests can sit at a circular array specified that all one sits between two friends.
Here’s the plan. Seat everyone in random order. Two guests who sit flank by flank are seatmates, and they power be friends, or strangers. Seatmates who are allies get a blue edge, and another allies get a gray edge. Seatmates who are strangers create a gap, which gets a dotted orange line. Here’s the chart from before as a party, seated in random order, alongside four gaps:
So, if we can discover a way that continually gets rid of all the gaps, afterward we volition have shown that the theorem is true. We’ll do it alongside a sequence of moves slightly akin to playing musical chairs.
2. Musical chairs
Say that strangers and sit flank by side, alongside fair clockwise of . And say that location alternatively at the table, there are two additional seatmates, and , alongside fair clockwise of , anywhere is a companion of , and is a companion of .
Here’s the move: everyone from clockwise about to stands up, and sits rear downward in the reverse order. That’s a flip. Afterward, sits next to , and sits next to , and those are the two pairs of friends.
In the following figure, the extend that flips is shaded blue. Drag the slider under it to observe it flip.
A flip closes the gap between and , and opens no new gap.
Why is Lemma 1 true? Inside the extend that flips, all visitant has the identical two seatmates as before, fair on contrary sides. So the lone seatmates who alter are at the two endpoints. Before the flip, those were and , who are strangers, and and . After the flip, they’re and , and and , who are friends. (If and were strangers too, afterward the flip closes two gaps at once.)
The companionship of and , and the companionship of and , cross akin an X. Let’s call a brace of friendships akin that a crossing: one from to , and one from to the visitant fair clockwise of . Each crossing gives a flip.
The following interactive fig runs the algorithm on the gathering from before, starting alongside the seating institution that happens to have four gaps, and flips until there are none.
Here’s the algorithm:
seat everyone in any order while several strangers u and v sit flank by side, alongside v fair clockwise of u: discover a companion x of u who sits fair counterclockwise of a companion y of v reverse the command of everyone from v about to x
So the entire evidence comes downward to one question. Do gaps always have corresponding crossings? In the next division we’ll answer that question.
3. Pass the potatoes
Recall that is the figure of guests at the party. Let’s compose for the figure of allies of visitant . Here’s what we search to prove:
Say strangers and sit flank by side, alongside fair clockwise of , and . Then location at the table, a companion of sits fair counterclockwise of a companion of .
One way to see how this is true is the following idea experiment. Give a red murphy to all companion of , and a Yukon Gold to all companion of . That’s potatoes, which is at smallest . Then everyone alongside a red murphy passes it one place clockwise, akin this:
After that, note that can no longer clasp any potatoes. So the another guests clasp all of the potatoes. Therefore, since there are at smallest total potatoes, several visitant holds two.
Let’s use to mention to a visitant alongside two potatoes (circled above). They have a Yukon Gold, so is a companion of . The red one came from the visitant fair counterclockwise of , who is a companion of , and that’s . That’s the crossing.
Back to Dirac’s theorem. If all visitant has at smallest friends, afterward for any two strangers, , so all gap has a crossing (Lemma 2). Each flip closes a gap and opens none (Lemma 1), so the figure of gaps drops alongside all flip, until there are none, and everyone sits between two friends.
4. References
Edgar Palmer discovered this evidence in the activity of Øystein Ore and wrote concerning it in The hidden algorithm of Ore’s theorem on Hamiltonian cycles (though he did not use meal tables and potatoes).
Dirac’s theorem archetypal appeared in his document Some theorems on theoretical graphs, in the Proceedings of the London Mathematical Society in 1952.
Homo sapiens. What an inventive, invincible species.
— The Fourth Doctor, The Ark in Space (1975)