Counterexamples to Hedetniemi's conjecture

Abstract

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

3 pages, minor corrections, a version accepted for publication