Abstract:
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.
Page(s):
170-172
DOI:
DOI not available
Published:
Journal: Journal of Basic and Applied Sciences, Volume: 10, Issue: 0, Year: 2014