The Erdős--Sós Theorem

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\ge 2$ vertices.