PAPER / ARXIV:2609.17877
David R. Wood
RESUMO
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\geq 2$ vertices.
NO MESMO MAPA