当前位置: X-MOL 学术Ann. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Counterexamples to Hedetniemi's conjecture
Annals of Mathematics ( IF 5.7 ) Pub Date : 2019-01-01 , DOI: 10.4007/annals.2019.190.2.6
Shitov

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

中文翻译:

赫德涅米猜想的反例

$G\times H$的色数可以小于有限简单图$G$和$H$的色数的最小值。
更新日期:2019-01-01
down
wechat
bug