Counterexamples to Hedetniemi's conjecture
Combinatorics
2019-06-17 v2
Abstract
The chromatic number of can be smaller than the minimum of the chromatic numbers of finite simple graphs and .
Cite
@article{arxiv.1905.02167,
title = {Counterexamples to Hedetniemi's conjecture},
author = {Yaroslav Shitov},
journal= {arXiv preprint arXiv:1905.02167},
year = {2019}
}
Comments
3 pages, minor corrections, a version accepted for publication