David R. Wood, The Erdős-Sós Theorem
September 18 Friday @ 4:30 PM - 5:30 PM KST
Room B332,
IBS (기초과학연구원)
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≥2 vertices.
