Hadwiger's conjecture for graphs with infinite chromatic number
Abstract
We construct a connected graph H such that (1) (H) = ω; (2) Kω, the complete graph on ω points, is not a minor of H. Therefore Hadwiger's conjecture does not hold for graphs with infinite coloring number.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.