Geodesic
New bounds for the clique-chromatic numbers of Johnson graphs
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 490 (2020), pp. 78-80

Voir la notice de l'article provenant de la source Math-Net.Ru

We significantly improve lower bounds on the clique-chromatic numbers for some families of Johnson graphs. A new upper bound on the clique-chromatic numbers for $G(n,r,r-1)$ and $G(n,3,1)$ is obtained. Finally, the exact value of the clique-chromatic number for $G(n,2,1)$ is provided.
Keywords: clique-chromatic numbers, Johnson graphs, Ramsey numbers. 
@article{DANMA_2020_490_a17,
     author = {A. M. Raigorodskii and M. Koshelev},
     title = {New bounds for the clique-chromatic numbers of {Johnson} graphs},
     journal = {Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleni\^a},
     pages = {78--80},
     publisher = {mathdoc},
     volume = {490},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DANMA_2020_490_a17/}
}
TY  - JOUR
AU  - A. M. Raigorodskii
AU  - M. Koshelev
TI  - New bounds for the clique-chromatic numbers of Johnson graphs
JO  - Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
PY  - 2020
SP  - 78
EP  - 80
VL  - 490
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DANMA_2020_490_a17/
LA  - ru
ID  - DANMA_2020_490_a17
ER  - 
%0 Journal Article
%A A. M. Raigorodskii
%A M. Koshelev
%T New bounds for the clique-chromatic numbers of Johnson graphs
%J Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
%D 2020
%P 78-80
%V 490
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DANMA_2020_490_a17/
%G ru
%F DANMA_2020_490_a17
A. M. Raigorodskii; M. Koshelev. New bounds for the clique-chromatic numbers of Johnson graphs. Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 490 (2020), pp. 78-80. http://geodesic.mathdoc.fr/item/DANMA_2020_490_a17/