A weak form of Hadwiger's conjecture
Combinatorics
2013-12-13 v3
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
Cite
@article{arxiv.1312.2829,
title = {A weak form of Hadwiger's conjecture},
author = {Dominic van der Zypen},
journal= {arXiv preprint arXiv:1312.2829},
year = {2013}
}