Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
WOW-284 asserts that the minimum dual degree of every connected graph of order at least three and girth at least five is at most the negative of its least distance eigenvalue. The paper refutes it with exact counterexamples of orders 38, 39, 40, 42 and 50, and develops a structural theory of the failure.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The author credits ChatGPT-5.6 Sol Pro with adversarial proof checking, proof exploration and Lean formalization, and assumes full responsibility for the mathematics, attribution and conclusions.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
No independent review, but the counterexamples are explicit and self-checking, and the source, exact certificates and build instructions are published at release v2.2.8 of the author's repository. Preprint, not refereed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.