Steven Raanes
The Ohio State University
Title
Counterexamples to the weak Hedetniemi Conjecture
Abstract
In 1966, Hedetniemi conjectured the chromatic number of the direct product of two graphs is the minimum chromatic number of the two factor graphs. This was disproved by Shitov in 2019, and since then there has been much interest in determining the extent to which Hedetniemi’s conjecture fails. I will talk about the history of this problem, why it is difficult to resolve using purely combinatorial methods, and motivate the topological methods I used to show Hedetniemi’s conjecture fails as strongly as possible, meaning there are pairs of graphs with arbitrary large chromatic number whose product has chromatic number five.