University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs

## Reducing Linear Hadwiger's Conjecture to Coloring Small GraphsAdd to your list(s) Download to your calendar using vCal - Michelle Delcourt, Toronto
- Thursday 14 October 2021, 15:00-16:00
- https://bham-ac-uk.zoom.us/j/87124623071.
If you have a question about this talk, please contact Johannes Carmesin. In 1943, Hadwiger conjectured that every graph with no $K_t$ minor is $(t-1)$-colorable for every $t\geq 1$. In the 1980s, Kostochka and Thomason independently proved that every graph with no $K_t$ minor has average degree ${O(t (log t) This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:- Combinatorics and Probability seminar
- School of Mathematics events
- https://bham-ac-uk.zoom.us/j/87124623071
Note that ex-directory lists are not shown. |
## Other listsSERENE Seminars Birmingham Popular Maths Lectures IRLab Seminars: Robotics, Computer Vision & AI## Other talksModelling uncertainty in image analysis. Extending the Lax type operator for finite W-algebras Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Quantum simulations using ultra cold ytterbium Test talk TBC |