Hadwiger's conjecture for graphs with infinite chromatic number
Combinatorics
2012-12-14 v1 Discrete Mathematics
Logic
Abstract
We construct a connected graph H such that (1) \chi(H) = \omega; (2) K_\omega, the complete graph on \omega points, is not a minor of H. Therefore Hadwiger's conjecture does not hold for graphs with infinite coloring number.
Cite
@article{arxiv.1212.3093,
title = {Hadwiger's conjecture for graphs with infinite chromatic number},
author = {Dominic van der Zypen},
journal= {arXiv preprint arXiv:1212.3093},
year = {2012}
}
Comments
2 pages