Hedetniemi's conjecture for uncountable graphs
Combinatorics
2013-07-26 v1 Logic
Abstract
It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic.
Cite
@article{arxiv.1307.6841,
title = {Hedetniemi's conjecture for uncountable graphs},
author = {Assaf Rinot},
journal= {arXiv preprint arXiv:1307.6841},
year = {2013}
}
Comments
http://www.assafrinot.com/paper/16