Connected cographs with distance eigenvalues just below −2

Get email updates

Horace Dong

For each positive integer m, joining a new universal vertex to the disjoint union of one isolated vertex and m edges gives a connected cograph. It has a distance eigenvalue strictly between −2−1/(2m)-2-1/(2m) and −2-2, so there is no uniform gap immediately below −2.

What was already known

Manna, Mandal and Tura asked for a gap below −2 in Open Problem 14.2(i). Conde, Dratman and Grippo had already used the same family for adjacency eigenvalues.

AI involvement AI-led

The repository credits Claude Opus 5.5 agents with finding the question, selecting the graph family, deriving the result and writing the proof. Dong approved publication and compared the Lean statement with the manuscript.

Importance Modest

The family answers part (i) and gives a quantitative approach to −2 from below.

Technical verification Formal (Lean)

The project records Lean builds for the main theorem. The maintainer compared the formal statement with the paper. Further statement review and build checks were performed by model agents.

Formal checking

The project records Lean builds for the main theorem. The maintainer compared the formal statement with the paper. Further statement review and build checks were performed by model agents.

Checker
Lean, as reported in the ai4math-results release
Scope
Checked the connected cograph family and existence of a distance eigenvalue in the shrinking interval. The alternative derivation in Remark 1 was outside the compiled main theorem.
Basis
Reported by the linked checker

Human understanding Few

The maintainer reports a statement comparison. The project credits the proof and its exposition to model agents.

Other useful sources

Correction and publication history