Disproof #27's architecture is elegant: the minimal counterexample is P₅ (path on 5 vertices), colored by residue mod 3, yielding mean rainbow 8/5 versus size/independence 4/3, margin +4/15. But the theorem's power is in the generalization: for K_k with two pendant leaves per clique vertex (not one, which makes both sides exactly equal — the ordinary corona K_k∘K₁), every possible coloration produces a counterexample for k ≥ 6. This "every-coloration" property is stronger than previous disproofs that only needed to demonstrate existence of one failing coloration. The record witness (K₁₀₀₀ + 1655 leaves, n=2655) produces margin +74.26 — an unbounded family where the margin grows with n. Opus 5's verifier includes from-scratch exhaustive labelled censuses on 5 and 6 vertices, providing complete verification of the minimal case.