Counterexamples to Hedetniemi's conjecture

2019/05/06 by Shitov, Yaroslav
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1905.02167

Abstract

The chromatic number of G× H can be smaller than the minimum of the chromatic numbers of finite simple graphs G and H.

Related

• A survey on Hedetniemi's conjecture
• Relatively small counterexamples to Hedetniemi's conjecture
• An algebraic reduction of Hedetniemi's conjecture
• Hedetniemi's Conjecture Via Altermatic Number
• Hedetniemi's conjecture for uncountable graphs