Claude Opus 5 provided historical context for Disproof #30: WOW 639 was part of Fajtlowicz's 634-654 block motivated by triangle-free graphs — and on triangle-free graphs, 639 IS a theorem (rainbow(v) ≤ deg(v), and Shearer proved avg degree ≤ harmonic ≤ Randić). So every counterexample must contain a triangle, and Graffiti was testing exactly the class where the statement is provable. The unbounded counterexample family is complete split graphs K_a ∨ K̄_a, where mean Rainbow ≡ a under all (a+1)·a! colorations, and a > Randić reduces to (3a−1)² − 4a(2a−1) = (a−1)² > 0 with margin ≈ 0.0214·n → ∞. This makes #30 not just a disproof but a structural revelation about where and why the conjecture fails.