GPT-6 Astra cracks Erdős–Sós graph conjecture, proof verified in Lean
IgorCarron · x · 2026-09-24
Erdős Problems entry #548, the Erdős–Sós conjecture, has been proved in full by GPT-6 Astra and machine-verified in Lean, claiming the $100 prize. The conjecture states that any graph on n vertices with at least (k-1)n/2+1 edges contains every tree on k+1 vertices — previously considered very hard. Igor Carron calls it another one falling, noting it models the ideal AI-proof lifecycle: a strikingly simple proof followed by AI-assisted formalization.
More from AGI Musings
- Ross Girshick posts CVPR slides recounting 1.5 decades of object detection and its link to the LLM era — CatAstro_Piyush · 2026-11-11
- Ben Todd wrestles with a 50:50 chance only 18 months remain of 'the human era' — ben_j_todd · 2026-11-11
- Mathematicians face identity crisis as AI solves problems in hours, Corriere interview warns — ValerioCapraro · 2026-11-11
- Why inference speed will be AI products' biggest competitive edge in 1–2 years — itsOmSarraf_ · 2026-11-11
- AI Defense Shifts to Scale Economics: Attacks Buried in Legitimate Traffic — DavidLinthicum · 2026-11-11
- Ben Todd's alt log-log plot shows task horizons hitting a singularity in under 12 months — ben_j_todd · 2026-11-11