arXiv Analytics

Sign in

arXiv:1212.3093 [math.CO]AbstractReferencesReviewsResources

Hadwiger's conjecture for graphs with infinite chromatic number

Dominic van der Zypen

Published 2012-12-13Version 1

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.

Comments: 2 pages
Categories: math.CO, cs.DM, math.LO
Subjects: 05C15, 05C83
Related articles: Most relevant | Search more
arXiv:1203.3710 [math.CO] (Published 2012-03-16, updated 2012-11-27)
A Note on Graph Characteristics and Hadwiger's Conjecture
arXiv:1303.2951 [math.CO] (Published 2013-03-12)
The Erdős-Hajnal conjecture for rainbow triangles
arXiv:1303.4061 [math.CO] (Published 2013-03-17)
An Erdős--Ko--Rado theorem for matchings in the complete graph

Links

Toolbox