Counterexamples to Hedetniemi's conjecture

By Yaroslav N. Shitov. Annals of Mathematics, 2019

82 citations recorded by the source corpus.

The chromatic number of $G\times H$ can be smaller than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/3d9611638686d7ca8c6f6739b3e1efc62bf8593b