Counterexamples to Hedetniemi's conjecture
Abstract
The chromatic number of G× H can be smaller than the minimum of the chromatic numbers of finite simple graphs G and H.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.