Dev claims OpenAI helped disprove Erdős–Simonovits Turán conjecture, generalizing r=2 to all r≥2
ctjlewis · x · 2026-09-12
Developer ctjlewis says OpenAI disproved Erdős and Simonovits's conjecture about the Turán number of r-degenerate graphs, and that despite knowing no math he used it to generalize the r=2 case to all r≥2.
He says attempts to find volunteers to verify the proof drew hostility from mathematicians, so he ended up paying a combinatorialist at NYU, with whom he now has a good relationship—after a bitter back-and-forth that illustrates tension between AI-assisted math and academic collaboration culture.
Related event: OpenAI Refutes Erdős–Simonovits Graph Theory Conjecture(2 posts)→
More from Research
- DeepMind researcher: all of mathematics will soon be formalizable, with agents hunting proofs — ChrSzegedy · 2026-10-28
- A fine-tuned 'cat obsession' control fools every AI welfare criterion — MirrorEthic_Anchor · 2026-10-28
- Sweeping every Qwen3-8B neuron, rated for weirdness by Haiku — Sauers_ · 2026-10-28
- Kevin Buzzard: Lean formalization revealed errors in theorems by 4 Fields medalists — Machine Learning Street Talk · 2026-10-28
- Follow-up repo machine-verifies Hamiltonian cycle results on top of OpenAI/Anthropic ETH refutation claims — xennygrimmato_ · 2026-10-28
- DiscoTrace wins EMNLP 2026 Best Paper: LLM answers lack humans' community-specific rhetorical diversity — TuhinChakr · 2026-10-28