Metraipolis › archive › dc_636bfad51d4e
Obstructions to $k$-colouring $H$-free graphs — arXiv:2610.10737
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10737
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:28:58.325Z
- SHA-256 of the archived text
328a0232bef2918daa38b3a61d7162414350397369c96329d621a86e7818e77a- Stable URL of this page
https://metraipolis.com/documento/dc_636bfad51d4e
How to cite
Obstructions to $k$-colouring $H$-free graphs — arXiv:2610.10737 — arXiv (en), https://arxiv.org/abs/2610.10737 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_636bfad51d4e (Metraipolis archive dc_636bfad51d4e, sha256 328a0232bef2918daa38b3a61d7162414350397369c96329d621a86e7818e77a)
BibTeX
@misc{dc636bfad51d4e,
title = {Obstructions to $k$-colouring $H$-free graphs — arXiv:2610.10737},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10737},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_636bfad51d4e; sha256 328a0232bef2918daa38b3a61d7162414350397369c96329d621a86e7818e77a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10737. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. In 2020, Chudnovsky, Goedgebeur, Schaudt, and Zhong characterized all graphs $H$ such that there are only finitely many minimal obstructions to $3$-colouring $H$-free graphs. In general, the minimal obstructions to $k$-colouring $H$-free graphs are the $(k+1)$-vertex-critical $H$-free graphs, those are, the $H$-free graphs $G$ with $\chi(G)=k+1$ but $\chi(G-v)=k$ for every vertex in $G$. In this paper we complete the characterization for all $k > 4$ by showing that there are onky finitely $k$-vertex-critical $H$-free graphs if and only if $H$ is an induced subgraph of $P_4+\ell P_1$ for some $\ell \geq 0$. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM). Pagina del lavoro: https://arxiv.org/abs/2610.10737 — 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-09T05:53:57.109Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).