Year: 2026
Type: preprint
Abstract: Hadwiger conjectured in 1943 that every graph with no $K_t$ minor has chromatic number at most $t-1$. Delcourt and Postle proved that every graph with no $K_t$ minor has chromatic number $O(t\log\log t)$. We build on their result to improve this bound to $O(t\log\log\log t)$.
Source: arXiv (Cornell University)
Authors: Liu, Chun-Hung, Luo, Jason
Institution: Texas A&M University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W7212026773