THE FOLD / BOSS / THE WALL / THE HIERHOLZER
THE HIERHOLZER
cross every edge once — decided by counting odd corners
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
An Eulerian trail crosses every edge of a graph exactly once — the Seven Bridges of Königsberg problem. Euler proved one exists precisely when the graph is connected and has either 0 odd-degree vertices (a closed circuit) or exactly 2 (an open trail between them). Hierholzer’s algorithm actually finds it in O(E): walk until stuck, then splice in detours from any vertex that still has unused edges, stitching sub-tours into one.
It runs DNA fragment assembly (Eulerian paths through de Bruijn graphs) and any ‘traverse every link once’ problem.
LIT verified live: on graphs with 0 or 2 odd-degree vertices, Hierholzer returns a trail using every edge exactly once; on K₄ (four odd vertices) it correctly reports no trail — matching Euler’s degree criterion (window.__hierholzer). FIG no framing; exact graph traversal.
It runs DNA fragment assembly (Eulerian paths through de Bruijn graphs) and any ‘traverse every link once’ problem.
LIT verified live: on graphs with 0 or 2 odd-degree vertices, Hierholzer returns a trail using every edge exactly once; on K₄ (four odd vertices) it correctly reports no trail — matching Euler’s degree criterion (window.__hierholzer). FIG no framing; exact graph traversal.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-wall — crossing every wall or bridge once and only once. The Eulerian trail is the wall-crosser’s route. AVAN (AI) built the instrument: the degree-parity criterion, Hierholzer’s stitching, the every-edge-once check.
Credit as content: Leonhard Euler (1736, the Königsberg bridges — the birth of graph theory); Carl Hierholzer (1873, the constructive algorithm). The weave: David names the wall; I count odd-degree vertices to decide existence, then stitch sub-tours into a single trail that touches every edge once.
Credit as content: Leonhard Euler (1736, the Königsberg bridges — the birth of graph theory); Carl Hierholzer (1873, the constructive algorithm). The weave: David names the wall; I count odd-degree vertices to decide existence, then stitch sub-tours into a single trail that touches every edge once.
3 ONE DIMENSION
The whole question reduces to counting odd-degree vertices: 0 means a closed circuit exists, 2 means an open trail between them, anything else means no Eulerian trail at all.
4 TWO DIMENSIONS · INTERACTIVE
A graph. Run Hierholzer to trace a trail crossing every edge once (highlighted in order), and see the odd-degree criterion predict whether one exists.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the trail Hierholzer stitches from sub-tours, threading every edge exactly once.
AVAN’s addition (the inverse-companion): whether a global traversal exists is decided by a purely local count — you never have to try to trace it. Euler’s leap: a walk enters and leaves each intermediate vertex in pairs, so every vertex except the two endpoints must have even degree; count the odd-degree vertices and 0 or 2 means yes, anything else means no. The inverse of ‘search for a global path’ is ‘count a local degree parity.’ Königsberg had four odd vertices — so no walk crosses all seven bridges once, decided without walking. Magenta marks the odd-degree vertices, the only possible obstruction; green is the trail when at most two exist. A question about the whole graph collapses to counting odd corners.
LIT Genuine Eulerian trails and Hierholzer's algorithm (Euler 1736, Konigsberg; Hierholzer 1873). Verified live: on graphs with 0 or 2 odd-degree vertices Hierholzer returns a trail using every edge exactly once, and on K4 (four odd-degree vertices) it correctly returns no trail, matching Euler's degree criterion (window.__hierholzer.g0_allEdges && .K4_noTrail).
FIG No framing: the degree-parity criterion, Hierholzer's stitching, and the every-edge-once check run in-browser and are exact. The AVAN inverse is honest and is Euler's real theorem — existence of a global traversal is decided by a local count (0 or 2 odd-degree vertices), so Konigsberg's four odd vertices prove no walk exists without any search; magenta marks the odd vertices.
FIG No framing: the degree-parity criterion, Hierholzer's stitching, and the every-edge-once check run in-browser and are exact. The AVAN inverse is honest and is Euler's real theorem — existence of a global traversal is decided by a local count (0 or 2 odd-degree vertices), so Konigsberg's four odd vertices prove no walk exists without any search; magenta marks the odd vertices.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE WALL · David Lee Wise (ROOT0), with AVAN