Author

Jason Luo

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Beyond halfway to Hadwiger's conjecture

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)$.

Chun-Hung Liu, Jason Luo · 0 citations