Sombor-Energy Conjecture
Does every nontrivial finite simple graph have noninteger Sombor energy? If are the eigenvalues of the Sombor matrix of a graph , its Sombor energy is The conjecture asserted that for every nontrivial graph. A connected graph on nine vertices is exhibited with , disproving the conjecture.
- Result
- Disproved
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Construction
- Field
- Spectral graph theory
- Posed by
- Nima Ghanbari
- Year posed
- 2021
- Years open
- 5y
- Solved
- 2026-07-30
- Model
- GPT-5.6 Thinking
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Unreviewed
- Publication
- Announced
- Significance
- 5 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The AI constructed a connected bipartite graph on nine vertices and calculated its Sombor spectrum exactly. Writing its Sombor matrix in the block form the singular values of were found to be Therefore, The AI also audited the edge list, degrees, connectivity, bipartition, matrix multiplication, characteristic polynomial, singular values and final energy calculation, and produced a self-contained proof.
Verification
The proof has been internally audited using exact calculations. The graph has nine vertices, fifteen distinct edges and degree sequence . Its connectivity, bipartition, Sombor matrix, product , singular values, complete spectrum and energy were independently recomputed within the AI conversation. The result has not yet been checked by an independent graph-theory expert, peer reviewer or formal proof assistant. A literature search located the original conjecture, the 2023 partial-results paper and its 2024 corrigendum, but did not locate an equivalent connected counterexample. This search does not establish absolute priority, and no claim is made that this is the first or a new counterexample.
Source
Submitted by Lamp