The Erd\H{o}s--S\'os Theorem

Abstract

We present an exposition of a proof, discovered by GPT-6 Astra, of the Erd\H{o}s--S\'os Conjecture, which states that every graph with average degree greater than $t-2$ contains every tree on $t\geq 2$ vertices.