W&M Featured Events
[PAST EVENT] Mathematics Colloquium - Michael Lafferty, W&M
Access & Features
- Free food
- Open to the public
Coloring graphs with no K8-4 minor
Hadwiger’s Conjecture from 1943 states that every graph with no Kt minor is (t−1)-colorable; it remains wide open for all t ≥ 7. For positive integers t and s, let Kt−s denote the family of graphs obtained from Kt by removing s edges. We say that a graph G has no Kt−sminor if it has no H minor for every H ∈ Kt−s. In 1971, Jakobsen proved that every graph with no K7-2 minor is 6-colorable. In this talk, we present work showing that every graph with no K8-4 minor is 7-colorable. This result provides support for H-Hadwiger’s Conjecture, a generalization of Hadwiger's Conjecture suggested by Paul Seymour in 2017.
Refreshments - Jones lobby at 1:30pm
Sponsored by: Mathematics
Contact
Yuming Sun