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/

[1] MacWilliams F.J., Sloane N.J.A., The theory of error-correcting codes, North-Holland, Amsterdam, 1977 | MR | Zbl

[2] Frankl P., Wilson R., “Intersection Theorems with Geometric Consequences”, Combinatorica, 1 (1981), 357–368 | DOI | MR | Zbl

[3] Sagdeev A.A., Raigorodskii A.M., On a Frankl-Wilson theorem and its geometric corollaries, Acta Math. Univ. Comenianae, 2019 | MR

[4] Bogolyubskii L.I., Raigorodskii A.M., “Zamechanie o nizhnikh otsenkakh khromaticheskikh chisel prostranstv maloi razmernosti s metrikami ${{l}_{1}}$ i ${{l}_{2}}$”, Matem. zametki, 105:2 (2019), 187–213 | DOI | MR | Zbl

[5] Pushnyakov F.A., “O kolichestvakh reber v porozhdennykh podgrafakh nekotorykh distantsionnykh grafov”, Matem. zametki, 105:4 (2019), 592–602 | DOI | MR | Zbl

[6] Shishunov E.D., Raigorodskii A.M., “O chislakh nezavisimosti nekotorykh distantsionnykh grafov s vershinami v ${{{\text{\{ }}{\kern 1pt} - {\kern 1pt} 1,0,1{\text{\} }}}^{n}}$”, DAN, 485:3 (2019), 269–271 | MR | Zbl

[7] Prosanov R.I., “Kontrprimery k gipoteze Borsuka, imeyuschie bolshoi obkhvat”, Matem. zametki, 105:6 (2019), 890–898 | DOI | MR | Zbl

[8] Kostina O.A., “On Lower Bounds for the Chromatic Number of Spheres”, Math. Notes, 105:1 (2019), 16–27 | DOI | MR | Zbl

[9] Frankl P., Kupavskii A., “Partition-free families of sets”, Proceedings of the London Math. Society, 2019 | DOI | MR

[10] Frankl P., Kupavskii A., “Families of sets with no matching of sizes 3 and 4”, Europ. J. Combinatorics, 75 (2019), 123–135 | DOI | MR | Zbl

[11] Shabanov D.A., Krokhmal N.E., Kravtsov D.A., “Panchromatic 3-colorings of random hypergraphs”, Europ. J. Combinatorics, 78 (2019), 28–43 | DOI | MR | Zbl

[12] Cherkashin D., Petrov F., “On Small $n$-Uniform Hypergraphs with Positive Discrepancy”, J. Combinatorial Theory. Series B | DOI | MR

[13] Balogh J., Cherkashin D., Kiselev S., “Coloring General Kneser Graphs and Hypergraphs via High-Discrepancy Hypergraphs”, Europ. J. Combinatorics, 79C (2019), 228–236 | DOI | MR | Zbl

[14] Fox J., Pach J., Suk A., “A Note on the Clique Chromatic Number of Geometric Graphs”, Geombinatorics, 28:2 (2019), 83–86 | MR

[15] Zakharov D.A., Raigorodskii A.M., “Kliko-khromaticheskie chisla grafov peresechenii”, Matem. zametki, 105:1 (2019), 142–144 | DOI | MR | Zbl