OpenAlex ·
Disproof of the dominating Hadwiger conjecture
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.35361
- Original
- Read it at the publisher
- Topics
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
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.