Ask a Question

Prefer a chat interface with context about you and your work?

A weak form of Hadwiger's Conjecture

A weak form of Hadwiger's Conjecture

We introduce the following weak version of Hadwiger's conjecture: If G is a graph and κ is a cardinal such that there is no coloring map c : G → κ, then Kκ is a minor of G.We prove that this statement is true for graphs with infinite chromatic number.