Abstract
The chromatic number of $G\times H$ can be less than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.
Citation
Yaroslav Shitov. "Counterexamples to Hedetniemi's conjecture." Ann. of Math. (2) 190 (2) 663 - 667, September 2019. https://doi.org/10.4007/annals.2019.190.2.6
Information
Published: September 2019
First available in Project Euclid: 21 December 2021
Digital Object Identifier: 10.4007/annals.2019.190.2.6
Subjects:
Primary:
05C15
Keywords:
Chromatic number
,
Hedetniemi's conjecture
,
multiplicative graphs
Rights: Copyright © 2019 Department of Mathematics, Princeton University
