Königsberg has no Euler walk
Theorem.Königsberg has no Euler walk — an Euler walk exists iff the number of odd-degree vertices is 0 or 2 — Königsberg has 4.
Proof.degrees 3,3,3,5 — four odd vertices where an Euler walk allows two: the 1736 founding theorem of graph theory, computed.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveSeven
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Königsberg has no Euler walk" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveSeven.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveSeven @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveSeven (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.