Metraipolis › archive › dc_148dbec49651
Coloring Small $K_t$-Minor-Free Graphs — arXiv:2609.08713
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08713
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:49:03.622Z
- SHA-256 of the archived text
25f77a1615d17849dc534afb83c9a9b50b153e2f360813e6d3a26e88c2bd3825- Stable URL of this page
https://metraipolis.com/documento/dc_148dbec49651
How to cite
Coloring Small $K_t$-Minor-Free Graphs — arXiv:2609.08713 — arXiv (en), https://arxiv.org/abs/2609.08713 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_148dbec49651 (Metraipolis archive dc_148dbec49651, sha256 25f77a1615d17849dc534afb83c9a9b50b153e2f360813e6d3a26e88c2bd3825)
BibTeX
@misc{dc148dbec49651,
title = {Coloring Small $K_t$-Minor-Free Graphs — arXiv:2609.08713},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08713},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_148dbec49651; sha256 25f77a1615d17849dc534afb83c9a9b50b153e2f360813e6d3a26e88c2bd3825},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08713. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Delcourt and Postle proved that every $K_t$-minor-free graph is $O(t\log\log t)$-colorable and reduced the Linear Hadwiger Conjecture to coloring $K_t$-minor-free graphs on $O(t\log^4 t)$ vertices. In this paper, we use the star contraction technique to improve their bound for small graphs and use their reduction to extend this improvement to all $K_t$-minor-free graphs. Thus we improve their $O(t\log\log t)$ bound to $O(t\sqrt{\log\log t})$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.08713 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.870Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).