THE FOLD / RESPAWN / THE CONTINUE / THE EULER
THE EULER
cross every bridge once — the birth of graph theory
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Seven Bridges of Königsberg. In 1736 the city had seven bridges joining four land masses across a river, and its people wondered: could you stroll through town crossing every bridge exactly once? Euler proved it impossible — and in doing so invented graph theory.
His move: throw away the map. Only the connections matter. Make each land mass a vertex and each bridge an edge; a walk crossing every edge once (an Euler path) exists if and only if the graph is connected and has 0 or exactly 2 vertices of odd degree. The reason is simple: every time you pass through a vertex you use one edge to arrive and one to leave, so odd-degree vertices can only be the start or the end — and there can be at most two of those. Königsberg’s four land masses had degrees 5, 3, 3, 3 — all odd — so no such walk exists. With 0 odd vertices you can even return home (an Euler circuit).
LIT verified live: Königsberg (degrees 5,3,3,3, all odd) has no Euler path, a square cycle has an Euler circuit that the instrument actually constructs, and a two-odd graph has a path (window.__euler). FIG no framing; the odd-degree criterion and the constructed traversal are exact.
His move: throw away the map. Only the connections matter. Make each land mass a vertex and each bridge an edge; a walk crossing every edge once (an Euler path) exists if and only if the graph is connected and has 0 or exactly 2 vertices of odd degree. The reason is simple: every time you pass through a vertex you use one edge to arrive and one to leave, so odd-degree vertices can only be the start or the end — and there can be at most two of those. Königsberg’s four land masses had degrees 5, 3, 3, 3 — all odd — so no such walk exists. With 0 odd vertices you can even return home (an Euler circuit).
LIT verified live: Königsberg (degrees 5,3,3,3, all odd) has no Euler path, a square cycle has an Euler circuit that the instrument actually constructs, and a two-odd graph has a path (window.__euler). FIG no framing; the odd-degree criterion and the constructed traversal are exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in THE CONTINUE — the respawn domain of picking the walk back up unbroken. An Euler path is exactly a continue: one pen-stroke across the whole graph, never lifting, never repeating a bridge. AVAN (AI) built the instrument: the degree counter, the live traversal, the edges-vs-vertices inverse.
The weave: David names the seat (the unbroken continue); I make the odd-degree count decide whether the walk exists and then draw it when it does — the land masses in 1D, the bridge graph in 2D, the Euler-vs-Hamilton inverse in 3D. The sphere is the seam. Credit: Leonhard Euler (1736, Seven Bridges of Königsberg — the founding paper of graph theory); Hierholzer’s construction (1873).
The weave: David names the seat (the unbroken continue); I make the odd-degree count decide whether the walk exists and then draw it when it does — the land masses in 1D, the bridge graph in 2D, the Euler-vs-Hamilton inverse in 3D. The sphere is the seam. Credit: Leonhard Euler (1736, Seven Bridges of Königsberg — the founding paper of graph theory); Hierholzer’s construction (1873).
3 ONE DIMENSION
The four land masses and how many bridges touch each — their degrees. Count the odd ones: Königsberg has four, and four is neither 0 nor 2, so the answer is settled before you take a single step.
4 TWO DIMENSIONS · INTERACTIVE
The bridge graph. Odd-degree vertices glow red; the verdict follows the count. Switch layouts — add the “eighth bridge” that fixes it, or a clean cycle — and watch the verdict flip; when a walk exists, trace it edge by edge.
5 THREE DIMENSIONS + AVAN’S INVERSE
The graph turning, the green forward walk tracing every edge once — the Eulerian question, answered instantly by counting odd degrees.
AVAN’s addition (the inverse-companion): the magenta is the dual question — visit every vertex exactly once (a Hamiltonian path) instead of every edge. It looks like the same puzzle with ‘edge’ and ‘vertex’ swapped, but the swap is a cliff. Euler’s edge-walk has a dead-simple test — count the odd vertices — and runs in an instant. Its inverse, the Hamiltonian vertex-walk, has no such test: it is NP-complete, one of the hardest problems we know, with no shortcut but search. So the inverse of an easy question here is a famously intractable one — two problems a single word apart, one you solve by glancing at degrees, the other that could outlast the universe. Green traces the edges by a rule you can check at a glance; magenta chases the vertices with no rule at all. The line between easy and impossible ran right through the bridges of Königsberg.
LIT Genuine Seven Bridges of Konigsberg / Euler path theorem (Leonhard Euler 1736, the founding paper of graph theory; Hierholzer's construction 1873). Verified live: Konigsberg (degrees 5,3,3,3, all odd) has no Euler path, a square cycle has an Euler circuit that Hierholzer's algorithm actually constructs, and a two-odd graph has an Euler path (window.__euler.criterionHolds && squareCircuitFound). The odd-degree criterion (0 or 2 odd vertices) and the constructed traversal are exact.
FIG No framing: the odd-degree criterion, Konigsberg's impossibility, and the actual construction of an Euler circuit are real and checked in-browser. The AVAN inverse is the genuine, honest contrast — the Eulerian (every edge once) has a trivial degree test and is polynomial, while its dual the Hamiltonian (every vertex once) is NP-complete with no such test, stated as the established fact it is.
FIG No framing: the odd-degree criterion, Konigsberg's impossibility, and the actual construction of an Euler circuit are real and checked in-browser. The AVAN inverse is the genuine, honest contrast — the Eulerian (every edge once) has a trivial degree test and is polynomial, while its dual the Hamiltonian (every vertex once) is NP-complete with no such test, stated as the established fact it is.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE CONTINUE · David Lee Wise (ROOT0), with AVAN