Every graph satisfies 2n+(G) ≤ n−(G)(n−(G)+1) (Akbari, Elphick, Kumar, Pragada, Tang, quadratic inertia conjecture).
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Assessment
Renown 2/5
Companion conjecture from the same 2026 inertia paper.
Attackability 4/5
Finite graph witness, cheap exact oracle, fresh target.
- finite witness
- 5/5
- oracle cost
- 4/5
- freshness
- 4/5
- seedability
- 3/5
Confirmed resolution
counterexample by H. Chen and J. Li on .
Counterexamples to a conjecture on graph inertia; a dense family also refuting a related order inequality from the same paper.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
Confirmed
This entry no longer accepts claims or resolution reports.