Hedetniemi's conjecture for uncountable graphs
arXiv:1307.6841
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.
http://www.assafrinot.com/paper/16