Counterexamples to Hedetniemi’s conjecture

Abstract

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

Authors

Yaroslav Shitov