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 …
5 events found.
Discrete Math Seminar
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 …
-
-
Daniel McGinnis, Multi-generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for $d$-Leray complexes
Room B332 IBS (기초과학연구원)A celebrated result of Bayer and Stillman from 1987 states that for a homogeneous ideal $I$ of a polynomial ring $S$, the regularities of $S/I$ and $S/\textrm{GIN}(I)$ are the same …
-
Julien Codsi, Recent progress in the tree-⍺ world
Room B332 IBS (기초과학연구원)Treewidth is a graph parameter commonly used to quantify how "close" a graph is to a tree. Although it is a cornerstone of structural graph theory and algorithm design, it …
-
Xiying Du, TBA
Room B332 IBS (기초과학연구원)