(GTN LIV:6) HEDETNIEMI'S CONJECTURE, 40 YEARS LATER
Claude Tardif · 2008
Hedetniemi’s conjecture states that the chromatic number of a categorical product of graphs is equal to the minimum of the chromatic numbers of the factors. We survey the many partial results surrounding this conjecture, to review the evidence and the counter evidence.