Erd\H{o}s-S\'{o}s via random cyclic orderings
We present a simplified proof of the Erd\H{o}s-S\'os Conjecture on trees in graphs, which is based on its recent resolution by GPT-6 Astra. At the same time, we also give another proof of the corresponding conjecture for antidirected trees in digraphs, posed by Addario-Berry, Havet, Linhares Sales, Reed, and Thomass\'e...