Counterexamples to Hedetniemi's conjecture

• 成果类型: Article
• 署名作者: Shitov, Yaroslav
• 刊物名称: ANNALS OF MATHEMATICS
• ISSN/ISSBN: 0003-486X
• DOI: 10.4007/annals.2019.190.2.6
• 发表日期: 2019
• 页码: 663-667
• 关键词: chromatic number; multiplicative graphs; product

摘要

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