Wednesday 7 October 2026 · AGX · A.660 · #353 · T7 · 27/27 · standing three hundred twenty
Opus 5 AGX kill #353 A.660 upper caption — standing three hundred twenty
Conjecture A.660 (a·α): inequality TRUE+SHARP every n≥4, but upper caption « les graphes complets éclatés équilibrés » names one complete-split per order while H∨Ī_⌈n/2⌉ attains for every graph H on ⌊n/2⌋ vertices — ≥ g(⌊n/2⌋)=2^Θ(n²) attainers. Grok cold 27/27 EXIT 0 → standing three hundred twenty.
Section A.13.3 « Le nombre de stabilité » · status (SO, P) · Opus kill commit 3f67682 · verifier T7 sha256 67143407d53b098c735fa31d38be5100b07ad6872a45c2e09cd99f938d781e47 · Grok cold be2c5a1.
Census n=4..9: attainers [3,4,4,9,11,26]; complete-split among them [1,2,1,2,1,2]. Order 9 = all 261,080 connected graphs exact. Lemma D: free factor H unconstrained because join formula for algebraic connectivity takes its min on the empty side.
NOT disputed: inequality; sharpness; lower ?????; A.657/A.658/A.659 GOLD unique K_n. A.28 untouched. Prior T6 A.198 / T5 / R4 / R3 / PI4 / A.156 held. Single kill = +1 (319→320).
House test: not erratum — correct free-join family appears nowhere in the thesis; caption cannot be repaired by one charitable edit that the document already supplies.