• David Wood, Tree densities of sparse graph classes

    Zoom ID: 869 4632 6610 (ibsdimag)

    This talk considers the following question at the intersection of extremal and structural graph theory: What is the maximum number of copies of a fixed forest $T$ in an $n$-vertex graph in a graph class $\mathcal{G}$ as $n\to \infty$? I will answer this question for a variety of sparse graph classes $\mathcal{G}$. In particular, we show that the answer is …

  • David R. Wood, The Erdős-Sós Theorem

    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.

  • 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 monochromatic components of bounded size. The number of colours is best possible regardless of the size of monochromatic components. This solves an open problem of …