Hadwiger's conjecture for graphs with infinite chromatic number

arXiv1212.3093MaRDI QIDQ6237987FDOQ6237987

Authors: Dominic van der Zypen 

Publication date: 13 December 2012

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.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

This page was built for publication: Hadwiger's conjecture for graphs with infinite chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237987)