Hedetniemi's conjecture for uncountable graphs
classification
🧮 math.CO
math.LO
keywords
chromaticgraphscardinalconjectureconstructiblecountablyeveryexist
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.