Counterexamples to Hedetniemi's conjecture

2019/08/22 by Yaroslav Shitov · 3 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Graph Labeling and Dimension Problems #Advanced Graph Theory Research

paper · pdf · doi:10.4007/annals.2019.190.2.6

openalex publication_date 2019/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Cited by

• On multiplicativity of directed graphs
• On the Independence Number of the Modular Product
• List of unsolved problems in mathematics [wikipedia]

Related

• Counterexamples to Hedetniemi's conjecture
• 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