Answers are grounded in this paper and cite their sources.
We prove the quasi-perfect graph conjecture of Dorjsembe et al. for Albertsonirregularity, without a restriction on maximum degree. An ordered-degree relaxation and thecentral graphicality constraint establish the unique maximum. An exact decomposition ofirregularity across the central degree cut then determines the second and third distinct maxima,with a finite certificate for the exceptional orders. The number of second maximizers is aFibonacci number outside five small-order exceptions. The third maximizers form two splitfamilies and, at odd orders, an additional family with one missing clique edge. Their multiplicityis given by a Fibonacci term and an exact binary-matrix orbit recurrence. We also provethat a deficit of at most cn restricts the degree repetitions to finitely many templates and, forsufficiently large order, forces the sum of their terminal distances to be at most ⌊c⌋. All finitecertificates use integer arithmetic and are supplied with executable Python code
No takes yet. Share an insight, caveat, or question.
Tony Newton (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: