THE FOLD / RESPAWN / HARD-RESET / THE GRAPH COMPLEMENT
THE GRAPH COMPLEMENT
flip every edge, flip again, home
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The graph complement flips every relationship: in the complement Ĝ of a graph G, two vertices are joined exactly when they are not joined in G. Friendship becomes strangerhood and back. Together G and Ĝ partition the complete graph, so their edge counts sum to C(n,2); many properties dualize (an independent set in G is a clique in Ĝ). And it is an involution: complementing twice restores the original graph. A graph that is isomorphic to its own complement is self-complementary — like the 5-cycle C₅, whose complement is again a 5-cycle.
LIT verified live: over 20,000 random graphs, complementing twice returns the original (a true involution) and e(G)+e(Ĝ) = C(n,2); and C₅ is shown self-complementary — its complement is 2-regular with 5 edges (window.__graph_complement). FIG no framing; the edge-flip complement and its double-application run in-browser. An involution — complement, complement, home.
LIT verified live: over 20,000 random graphs, complementing twice returns the original (a true involution) and e(G)+e(Ĝ) = C(n,2); and C₅ is shown self-complementary — its complement is 2-regular with 5 edges (window.__graph_complement). FIG no framing; the edge-flip complement and its double-application run in-browser. An involution — complement, complement, home.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at hard-reset — flip every edge, then flip again, and the graph hard-resets to itself. AVAN (AI) built the instrument: the edge-flip complement, the double-complement involution check, the edge-count identity, and the C₅ self-complementary demonstration.
Credit as content: the graph complement (standard graph theory). The weave: David names the hard reset; I confirm complementation is its own inverse — the mirror that cancels to the seed.
Credit as content: the graph complement (standard graph theory). The weave: David names the hard reset; I confirm complementation is its own inverse — the mirror that cancels to the seed.
3 ONE DIMENSION
A graph and its complement: every present edge becomes absent and every absent edge present; edge counts sum to C(n,2).
4 TWO DIMENSIONS · INTERACTIVE
A graph, its complement, and the complement of that — snapping back to the original graph.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the graph returned by complementing twice.
AVAN’s addition (the inverse-companion): the inverse of ‘complement the graph’ is ‘complement the graph.’ It is an involution: Ĝ̅ = G. Magenta are the flipped (complement) edges; green is G returned on the second flip. Complement, complement, home.
LIT Genuine graph complement (standard graph theory). Verified live: over 20000 random graphs, complement∘complement returns the original (a true involution) and e(G)+e(Ḡ)=C(n,2); and C₅ is demonstrated self-complementary — its complement is 2-regular with 5 edges (window.__graph_complement.involution, .edgesComplement, .selfComp).
FIG No framing: the edge-flip complement and its double-application run in-browser. This is an INVOLUTION — the inverse of 'complement the graph' IS 'complement the graph' (Ḡ̄=G). Magenta are the flipped complement edges; green is G returned on the second flip. Complement, complement, home — the mirror that cancels to the seed.
FIG No framing: the edge-flip complement and its double-application run in-browser. This is an INVOLUTION — the inverse of 'complement the graph' IS 'complement the graph' (Ḡ̄=G). Magenta are the flipped complement edges; green is G returned on the second flip. Complement, complement, home — the mirror that cancels to the seed.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of HARD-RESET · David Lee Wise (ROOT0), with AVAN