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
- Cory Doctorow on the 'Big AI Lie': Can't Build Sandboxes, Claims You Built God — AlexTensor · 2026-09-24
- DHH says hand-writing code is over as Pragmatic Engineer unpaywalls AI coding mega-trend piece — IgorCarron · 2026-09-24
- Jensen Huang says uncontrolled labs should shut down; Gary Marcus calls to pause OpenAI — Gary Marcus · 2026-09-24
- NYU Prof Questions AI-Slop Panic: AI Reviewers Rarely Accept Papers — ipeirotis · 2026-09-24
- Nick Clegg slammed for saying AI "can't even read a PDF" while pushing end of remote work — dioscuri · 2026-09-24
- Richard Susskind publishes The Future of Law: Reflections and Predictions via OUP — carlbfrey · 2026-09-24