A survey on Hedetniemi's conjecture

Xuding Zhu

In 1966, Hedetniemi conjectured that for any positive integer $n$ and graphs $G$ and $H$, if neither $G$ nor $H$ is $n$-colourable, then $G\times H$ is not $n$-colourable. This co…