Resolve the double-comet conjecture below order 200

Determine whether the minimum adjacency spectral gap among trees of every order 21 through 199 is attained by a balanced double comet, thereby resolving the remaining cases of the double-comet conjecture.

Background

The paper proves that every adjacency-spectral-gap minimizer among trees of order n≥200 is a balanced double comet. The original conjecture asserts that this holds for every n≥2, and prior computer verification covered only n≤20. Consequently, the orders 21≤n≤199 remain unresolved by the results presented here.

Section 7 explains that the threshold 200 arises from forcing the second adjacency eigenvalue above 4 and then bounding the total spectral-center defect by three. Lowering the threshold would require either a stronger global comparison or a rigidity criterion valid at smaller spectral radii.

References

It also does not settle the conjecture for every smaller order. Combined with the verification reported in , it reduces the remaining orders in Conjecture~\ref{conj:double-comet} to $21\le n\le199$.

— A finite threshold for the double-comet conjecture  (2610.02913 - Cai et al., 2 Oct 2026) in Section 1, immediately after Theorem 1; Section 7 (Further questions)