THE FOLD / BOSS / THE FINAL BOSS / THE VIZING
THE VIZING
colouring edges with almost the fewest colours
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Vizing’s theorem is a startlingly tight result about edge colouring: to colour the edges of any simple graph so that no two edges meeting at a vertex share a colour, you need either Δ or Δ + 1 colours — where Δ is the maximum degree. Never fewer than Δ (the edges at the busiest vertex all differ), and never more than Δ + 1. So every graph is one of just two classes: Class 1 (Δ colours suffice, like every complete graph K2n) or Class 2 (needs Δ + 1, like every odd cycle). The whole infinite variety of graphs collapses to a one-bit question.
LIT verified live: for hundreds of random graphs, the exact edge-chromatic number (found by exhaustive colouring) is always Δ or Δ + 1 — K4 is Class 1 (χ′ = 3), the 5-cycle is Class 2 (χ′ = 3 = Δ + 1) (window.__vizing). FIG no framing; brute-force minimum edge colouring vs the two-value bound.
LIT verified live: for hundreds of random graphs, the exact edge-chromatic number (found by exhaustive colouring) is always Δ or Δ + 1 — K4 is Class 1 (χ′ = 3), the 5-cycle is Class 2 (χ′ = 3 = Δ + 1) (window.__vizing). FIG no framing; brute-force minimum edge colouring vs the two-value bound.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-final-boss — the whole graph reduces to one last question with only two answers, Δ or Δ + 1; that single extra colour is the final boss. AVAN (AI) built the instrument: the maximum-degree count, the exhaustive minimum edge colouring, and the check that the answer is always Δ or Δ + 1.
Credit as content: Vadim G. Vizing (1964). The weave: David names the-final-boss; I find the fewest colours that properly colour a graph’s edges by exhaustive search, and confirm it never falls below Δ nor rises above Δ + 1 — every graph is Class 1 or Class 2, nothing else.
Credit as content: Vadim G. Vizing (1964). The weave: David names the-final-boss; I find the fewest colours that properly colour a graph’s edges by exhaustive search, and confirm it never falls below Δ nor rises above Δ + 1 — every graph is Class 1 or Class 2, nothing else.
3 ONE DIMENSION
K4: max degree 3, edges 3-colourable → Class 1 (χ′ = Δ = 3). C5 (5-cycle): max degree 2, but needs 3 colours → Class 2 (χ′ = Δ + 1 = 3). Always one or the other.
4 TWO DIMENSIONS · INTERACTIVE
A graph, its maximum degree Δ, and its exact edge-chromatic number; the Δ/Δ+1 dichotomy checked.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: an edge colouring within one of the minimum.
AVAN’s addition (the inverse-companion): don’t ask how many colours a graph’s edges need across all possibilities — ask only which of two: Δ or Δ + 1. The inverse of ‘compute the edge-chromatic number from scratch’ is ‘it is one of exactly two values — decide the single bit.’ Magenta is the open-ended count; green is the two-valued Vizing answer. A whole graph, one bit.
LIT Genuine Vizing's theorem (Vadim G. Vizing, 1964). Verified live: for 400 random graphs, the exact minimum edge-chromatic number found by exhaustive proper edge colouring is always Δ or Δ+1 (window.__vizing.inRange); K₄ is Class 1 (χ'=Δ=3) and the 5-cycle is Class 2 (χ'=Δ+1=3).
FIG No framing: the maximum-degree count, the exhaustive minimum edge colouring, and the Δ/Δ+1 check all run in-browser. The AVAN inverse is honest — Vizing collapses the open-ended 'how many colours' to a single bit (Δ or Δ+1), a genuine two-valued classification; magenta is the open-ended count, green the two-valued Vizing answer. A whole graph, one bit.
FIG No framing: the maximum-degree count, the exhaustive minimum edge colouring, and the Δ/Δ+1 check all run in-browser. The AVAN inverse is honest — Vizing collapses the open-ended 'how many colours' to a single bit (Δ or Δ+1), a genuine two-valued classification; magenta is the open-ended count, green the two-valued Vizing answer. A whole graph, one bit.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE FINAL BOSS · David Lee Wise (ROOT0), with AVAN