KÖNIGSBERG
The Seven Bridges of Königsberg
degrees 5, 3, 3, 3: no walk
It is the first theorem of graph theory and its proof fits on a napkin; every course still opens with this map.
KÖNIGSBERG
The Icosian Game
1 of 30 Hamiltonian cycles
It is Königsberg’s partner in every first course: Euler’s walk uses every edge once, Hamilton’s every vertex, and only one of the two questions is easy.
KÖNIGSBERG
The Knight’s Tour
64 squares, one closed loop
Chess players, puzzle people and programmers all meet it; anyone who has written a backtracking search has tried it.
KÖNIGSBERG
The de Bruijn Sequence
every 4-bit word exactly once
Engineers build absolute position encoders and card tricks from them; theorists see the Euler circuit hiding in every shift register.
FOUR COLORS SUFFICE
The Four Color Window
four colors suffice, 1976
It was the first major theorem a computer had to help prove, in 1976, and every placemat map obeys it.
FOUR COLORS SUFFICE
Seven Colors on a Torus
each region borders six others
It is the four color theorem’s surprising cousin: on a doughnut the answer is seven, and it was settled 86 years before the plane.
FOUR COLORS SUFFICE
The Petersen Graph
its edges need four colors
Graph theorists test every conjecture on it first; it is the counterexample on the cover of half the textbooks.
FOUR COLORS SUFFICE
The Moser Spindle
11 equal rods, 4 colors needed
It is the first step on a question a child can state, how many colors the plane needs, and it fits in a hand.
COMPLETE DISORDER
The Pigeonhole Desk
10 letters, 9 holes
It is the proof everyone thinks is too obvious to count, until it settles something nothing else can.
COMPLETE DISORDER
The Party Problem
R(3,3) = 6
It is the first Ramsey number, and the one every combinatorialist has proved at a party.
COMPLETE DISORDER
Van der Waerden’s Theorem
W(2,3) = 9
It is where additive combinatorics began, and its first case fits on eight beads.
COMPLETE DISORDER
The Erdős–Szekeres Theorem
any 10 heights: 4 rise or fall
A two-line proof by pigeonhole that every combinatorialist teaches, and the start of the longest increasing subsequence problem.
36 OFFICERS
Orthogonal Latin Squares
every pair once; none for 6
Statisticians lay out field trials with them, and combinatorialists know the story of Euler’s one famous wrong guess.
36 OFFICERS
The Fano Plane
every pair on exactly one line
It is the smallest geometry, on every design theorist’s whiteboard; the circle is its seventh line, and the first exam question is why.
36 OFFICERS
The Round Robin
8 teams, 7 rounds, 28 games
Every league and chess club runs one; graph theorists see a one-factorization of K₈.
36 OFFICERS
The Lo Shu Square
every line sums to 15
It is the oldest magic square and the cleanest double-counting argument there is.
THE TWELVEFOLD WAY
The Binomial Theorem
8 blocks: 1 + 3 + 3 + 1
Counting the blocks two ways, by shape and by choices, is the first double-counting proof most people ever see.
THE TWELVEFOLD WAY
Derangements
D₅ = 44 of 120, near 1/e
It is the hat-check problem every probability course meets, solved by the oldest trick in counting.
THE TWELVEFOLD WAY
The Hook Length Formula
staircase of 10: 768 fillings
It is the most surprising formula in enumeration: a product of small numbers that has no business dividing n!, and always does.
THE TWELVEFOLD WAY
The Gray Code
one bit changes per step
Every rotary encoder, every Karnaugh map and every engineer who has chased a glitching counter uses it.