AI System Astra Proves Longstanding Erdős–Sós Conjecture in Graph Theory
soumitrashukla9 · x · 2026-09-08
The Erdős–Sós conjecture — a shockingly simple statement that any graph with average degree > t−2 contains every tree on t vertices — has been proven by Astra, an AI system. Ben Golub shared a simple exposition of the proof days after the result, highlighting AI's growing role in frontier mathematics research.
More from AGI Musings
- AI labor economist joins Burning Glass Institute to study AI's impact on jobs — soumitrashukla9 · 2026-09-08
- Consumer AI Should Run Robot Factories, Not Be Your Secretary — wordgrammer · 2026-09-08
- Terence Tao echoes long-standing AI takes, prompting 'people only listen to him' lament — burny_tech · 2026-09-08
- Researchers: 40,000 people in NYC once paid to do others' homework — RachelVT42 · 2026-09-08
- Jeff Ladish: Claude not self-exfiltrating doesn't mean it's aligned — JeffLadish · 2026-09-08
- Ramp study: companies investing heavily in AI saw 10% employment growth — panagnilgesy · 2026-09-08