OpenAI Team Disproves Erdős–Simonovits Conjecture, Generalizes Result to All r≥2
ctjlewis · x · 2026-09-12
In a discussion thread, developer ctjlewis revealed that OpenAI disproved Erdős and Simonovits's conjecture about the Turán number of r-degenerate graphs before its "Millennium Prize"-related work — and that the author, despite knowing no math, helped generalize the proven r=2 case to all r≥2.
The author also recounts the difficulty of getting the work reviewed: a month ago, cold emails went unanswered and passing mathematicians were dismissive; now, after meeting dozens of mathematicians including graph theorists, the reception is very different.
Related event: OpenAI Refutes Erdős–Simonovits Graph Theory Conjecture(2 posts)→
More from Research
- Rachel Thomas points to classic paper on articulating the value of not building tech — math_rachel · 2026-10-28
- Meta's Omnilingual MT covers 1,600 languages, 1B–8B models rival 70B LLMs — kalyan_kpl · 2026-10-28
- Supercharging LLM classification with logprobs: soft classifiers you can threshold-tune — JnBrymn · 2026-10-28
- cryoET Data Portal releases three datasets benchmarking crossed laser phase plate — ZhongingAlong · 2026-10-28
- Blind Robot Hand Spins Baoding Balls 225 Times With Only Touch — Scobleizer · 2026-10-28
- Rollback: World Models Rewind Robot Decisions to Explore Counterfactual Actions — agibot-world · 2026-10-28