Hadwiger's conjecture for graphs with infinite chromatic number
classification
🧮 math.CO
cs.DMmath.LO
keywords
omegaconjecturegraphgraphshadwigerinfinitenumberchromatic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.