Geodesic
Counterexamples to Hedetniemi’s conjecture
Annals of mathematics, Tome 190 (2019) no. 2, pp. 663-667

Voir la notice de l'article provenant de la source Annals of Mathematics website

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

@article{10_4007_annals_2019_190_2_6,
     author = {Yaroslav Shitov},
     title = {Counterexamples to {Hedetniemi{\textquoteright}s} conjecture},
     journal = {Annals of mathematics},
     pages = {663--667},
     publisher = {mathdoc},
     volume = {190},
     number = {2},
     year = {2019},
     doi = {10.4007/annals.2019.190.2.6},
     mrnumber = {3997132},
     zbl = {07107185},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2019.190.2.6/}
}
TY  - JOUR
AU  - Yaroslav Shitov
TI  - Counterexamples to Hedetniemi’s conjecture
JO  - Annals of mathematics
PY  - 2019
SP  - 663
EP  - 667
VL  - 190
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4007/annals.2019.190.2.6/
DO  - 10.4007/annals.2019.190.2.6
LA  - en
ID  - 10_4007_annals_2019_190_2_6
ER  - 
%0 Journal Article
%A Yaroslav Shitov
%T Counterexamples to Hedetniemi’s conjecture
%J Annals of mathematics
%D 2019
%P 663-667
%V 190
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4007/annals.2019.190.2.6/
%R 10.4007/annals.2019.190.2.6
%G en
%F 10_4007_annals_2019_190_2_6
Yaroslav Shitov. Counterexamples to Hedetniemi’s conjecture. Annals of mathematics, Tome 190 (2019) no. 2, pp. 663-667. doi: 10.4007/annals.2019.190.2.6

Cité par Sources :