Paper draft claims the Erdős–Simonovits degeneracy conjecture fails for all r ≥ 2
ctjlewis · x · 2026-08-04
A reply points to a draft proof, and the attached paper shows a formal result on the Erdős–Simonovits degeneracy conjecture.
- The paper claims the conjecture is false for all r ≥ 2.
- It presents a layered graph construction and proves a connected bipartite graph Hr with degeneracy exactly r.
- The abstract states that for sufficiently large n, ex(n; Hr) ≥ c n^(2-1/r+1/(28r^2)).
- For r = 3, the exponent improves to 5/3 + 1/160.
- The paper also analyzes the construction’s thresholds, the Gibbs-weight phase transition, and why the method’s ceiling is 1/(8r^2).
The screenshots show the structure of the proof: forbidden graph construction, density thresholds, entropy bounds, and the positivity of the feasible window.
Related event: AI-Assisted Proof Refutes Classic Erdős Degeneracy Conjecture(2 posts)→
More from Research
- One Layer Deeper launches an H100-only competition for deeper reasoning — aryaman2020 · 2026-08-04
- Locus says it beat most human teams across live public ML competitions — rohanpaul_ai · 2026-08-04
- Pure VLAs may not need long-horizon planning if VLMs can cover it — m_wulfmeier · 2026-08-04
- Anthropic says Fable 5 reproduced 5 of OpenAI’s 10 Astra math advances in 24 hours — EricBuess · 2026-08-04
- New CCN poster finds LLM-brain alignment scales differently across cortical systems — neuranna · 2026-08-04
- ThursdAI explores whether Codex and multi-agent math can solve Erdős problems — thursdai_pod · 2026-08-04