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

Keywords: Graph theory, graph colouring, graph minors, Hadwiger’s conjecture