Year: 2026
Type: preprint
Abstract: Hadwiger's conjecture (1943) states that every graph $G$ with chromatic number at least $t$ contains a $K_t$-model: a collection of $t$ vertex-disjoint connected subgraphs $T_1,\dots,T_t$ such that for all $1\le i
Source: arXiv (Cornell University)
Authors: Illingworth, Freddie, Steiner, Raphael
Institutions: University College London, ETH Zurich
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214781091