A new upper bound on the chromatic number of graphs with no odd minor
arXiv:1912.07647
Abstract
Gerards and Seymour conjectured that every graph with no odd minor is -colorable. This is a strengthening of the famous Hadwiger's Conjecture. Geelen et al. proved that every graph with no odd minor is -colorable. Using the methods the present authors and Postle recently developed for coloring graphs with no minor, we make the first improvement on this bound by showing that every graph with no odd minor is -colorable for every .
References in corpus (1)
Cited by in corpus (5)
- Breaking the degeneracy barrier for coloring graphs with no minor
- An even better Density Increment Theorem and its application to Hadwiger's Conjecture
- Further progress towards Hadwiger's conjecture
- Connectivity and choosability of graphs with no minor
- Further Progress towards the List and Odd Versions of Hadwiger's Conjecture