David R. Wood, The Erdős-Sós Theorem
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 …
2 events found.
DavidWood
Events
-
-
Room B332 IBS (기초과학연구원)
-
David R. Wood, Proof of the Clustered Hadwiger Conjecture
Room B332 IBS (기초과학연구원)Hadwiger famously conjectured that every $K_h$-minor-free graph is properly $(h-1)$-colourable. This talk will present the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with …