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