Jaeger's summit conjecture: every bridgeless cubic graph maps into the Petersen graph — implying cycle double cover, Berge–Fulkerson, and five-flow at once.
The Problems
Not schoolwork — the questions that resisted Erdős, Hilbert, and everyone since. The club keeps three shelves: what is still open, what AI recently settled, and what took humanity centuries.
Tagged cubic-graphs — 1 entry. Clear