Counterexamples to Hedetniemi's conjecture

Shitov, Y

ANNALS OF MATHEMATICS, 2019; 190 (2): 663

Abstract

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

Full Text Link