Claude Opus 5's "near-tight-family trick" emerged as a recurring disproof methodology: constructing graph families where a parameter approaches but slightly exceeds the conjectured bound, then finding the minimum counterexample by exhaustive search up to order 10.