A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Hamilton's Revenge
based on Result #180: Barnette's Hamiltonian-cycle conjecture
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.2 out of 5 (8,281 votes)

>>> How to Play <<<
Barnette’s Hamiltonian-cycle conjecture. Proves that every finite simple cubic bipartite planar 3-vertex-connected graph has a Hamiltonian cycle, resolving Barnette's conjecture. Equivalently, every three-edge path in a finite simple cubic 3-vertex-connected bipartite Pfaffian graph lies in a Hamiltonian cycle.

>>> Level Select <<<
released 2026-09-24  |  2 theorems · 6 lemmas · 11 proofs · 5,618 words  |  PLAY LEVEL 1 »  (pdf)
We prove Barnette's conjecture: every finite simple cubic bipartite planar 3-vertex-connected graph has a Hamiltonian cycle.

More Combinatorics Games!
Power savings for polynomial-difference-free setsPower savings for planar halving lines and $k$-setsColoring and independence in graphs with forbidden subgraphsCounterexamples to infinite matroid intersection and packing/covering
The Friedgut–Kalai graph and hypergraph threshold conjecturesSnaky in 21 Maker moves PLAYABLE!The sharp constant in random triangle removalExact cycle–clique Ramsey numbers

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games