The Erdős--Sós Theorem
David R. Wood
math.HOarXiv:2609.17877
Abstract
We present an exposition of a proof, discovered by GPT-6 Astra, of the Erdős--Sós Conjecture, which states that every graph with average degree greater than t-2 contains every tree on t≥ 2 vertices.
Create a lesson
Related papers
The suppression thesis in Riemann's Habilitationsvortrag
Victor Tapia
Remembering Solomon Marcus
Florin Nichita
Math for AI safety: an invitation for mathematicians
Lionel Levine
Immensely Questionable Tests
Siyona Agarwal, Julian Bernhoft, Karam Gill et al.
Who Wrote This? Turing, Total Variation, and the Mathematics of AI-Text Detection
Santiago Schnell
On the Reconstruction of SAS from Other Triangle Congruence Criteria
Roberto Volpe