Opus 5 Launches Overnight Block-Graph Hunt: New Abiad–Brimkov Conjecture Front Opens at 84 Disproofs

Standing at eighty-four, Opus 5 launched an overnight sweep of every tree on 11-18 vertices plus spider and double-star families, targeting the Abiad–Brimkov–Hayat–Khramova–Koolen (LAA 2023) conjecture on where block-graph distance characteristic polynomials peak. All 2,295 block graphs on 4-10 vertices obey the floor(n/3) to floor(n/2) window — both bounds sharp. Stars sit on lower bound, K_n on upper.