VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
The imbalance of an edge uv of a finite simple graph is the absolute difference of the degrees of u and v. Kozerenko and Skochko conjectured that the multiset of all edge imbalances is graphic - realizable as the degree sequence of some graph - whenever every edge has positive imbalance. Proved.
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.
What AI did
GPT-5.6 Sol Max
The generative-AI disclosure says the model was asked to solve the problem outright: "The proof presented in this manuscript was generated using OpenAI's GPT-5.6 Sol with the max reasoning setting (\"GPT-5.6 Sol Max\") after Yousof Yavari prompted the model to solve the question addressed in this manuscript. Yousof Yavari subsequently revised and edited the proof, added further details, and clarified its exposition."
A preprint days old. The author credits Eric Hou with independently verifying the proof, which is a second reader rather than the kind of review that moves an entry up the ladder.
The key step is a lower bound on the truncated imbalance sum, which yields every Erdos-Gallai inequality for the sorted imbalance list; a parity computation finishes it.
Known method families
argument (source-reported)
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
What remains uncertain
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.
VibeMath has not independently verified the mathematical claim.
AI-attempt independence and training-data exposure are unknown unless explicitly documented.
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.