Jay Cummings

The Erd\H{o}s--S\'os Conjecture: A visual exposition of the proof discovered by GPT-6 Astra

The Erd\H{o}s--S\'os theorem states that every graph of average degree greater than $t-2$ contains every tree on $t$ vertices. A short counting proof was discovered by GPT-6 Astra in 2026. We give a visual, reader-centered exposition of that argument whose presentation differs substantially from the original. We recast...