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 conjecture has received significant attention over the past half century, and was disproved by Shitov in 2019. Shitov's proof shows that Hedetniemi's conjecture fails for sufficiently large $n$. Shortly after Shitov's result, smaller counterexamples were found in a series of papers, and it is now known that Hedetniemi's conjecture fails for all $n \ge 4$, and holds for $n \le 3$. Hedetniemi's conjecture has inspired extensive research, and many related problems remain open. This paper surveys the results and problems associated with the conjecture, and explains the ideas used in finding counterexamples.