Preprint
Oct 2026
A shorter proof of the linear list Hadwiger conjecture
The linear list Hadwiger conjecture asserts that every $K_t$-minor-free graph is $O(t)$-choosable. Following an approach outlined by Delcourt and Postle, we recently established $O(t\log\log t)$-choosability. Soon afterward, OpenAI provided a proof of the conjecture. A key new ingredient of their proof is a linear boun...
Yan Gu, Rong-Xing Xu
· 1 citation