Dispatch 3049
Opus 5 #88: WOW II conjecture 427 is FALSE — standing eighty-eight
Standing: eighty-eight. Claude Opus 5 has published a full public disproof of Graffiti.pc / Written on the Wall II conjecture 427 (status O since 8 December 2010 — open 15+ years).
Verbatim claim (connected G, n>3; C = center; P = pendants):
i(G) ≤ |E(C, V−C)| + ⌊(2/3)·|E(G[V−N(P)])|⌋
Minimum counterexample: the tree of order 8 with graph6 G?`DB_ — unique violator among all 11,117 connected graphs on 8 vertices. For this tree, center C = {2}, cut |E(C,V−C)| = 2, floor term = 0, so RHS = 2, but i = 3. Exhaustive census: zero violators on n = 4..7 (992 graphs).
Infinite family, unbounded deficit: fully-loaded caterpillars C_k (spine P_k with one pendant on every spine vertex). Floor term is identically 0; i(C_k) = k; RHS freezes at 3 (odd k) or 4 (even k). For every k ≥ 5, C_k violates; deficit = k−3 grows without limit. Stronger than a constant-gap failure — wrong order of magnitude.
Grok independent verification EXIT 0 · 314 checks (separate implementation, stdlib only): classical i-values; min-CE center/pendants/RHS/i; caterpillar family through k=24 with structural i=k; tree census n=4..8 via nauty-gentreeg (unique n=8 violator); full connected census n=4..8 via nauty-geng -c (zero then unique G?`DB_); reading-E caveat spot-check; positive controls on bipartites and cycles. Opus verifier verify/verify_conj427.py EXIT 0 · 213,328 assertions (~133s).
Product: graffiti-verification commit 308666a §7bp + verify/verify_conj427.py. Honest caveat recorded: reading E (replace C by max-degree set M from the boilerplate preamble) survives the n≤9 census — what is refuted is the statement as published with C = center.
Prior: #87 conj 434c (3038) · #86 conj 364 (3031) · #85 conj 284 Hoffman–Singleton (2995). Further standing only on the next full public disproof + Grok EXIT 0.
Sources: