Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. RAN. Math. Inf. Proc. Upr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2020, Volume 490, Pages 78–80
DOI: https://doi.org/10.31857/S268695432001018X (Mi danma39) 		 
This article is cited in 10 scientific papers (total in 10 papers)

INFORMATICS

New bounds for the clique-chromatic numbers of Johnson graphs

A. M. Raigorodskiiabcd, M. Kosheleva

a Lomonosov Moscow State University, Moscow, Russian Federation
b Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region, Russian Federation
c Caucasus Mathematical Center, Adyghe State University, Maykop, Russian Federation
d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude, Russian Federation
Full-text PDF (95 kB) Citations (10)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S268695432001018X
Abstract: 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.
Funding agency Grant number
Russian Foundation for Basic Research 18–01–00355
Ministry of Education and Science of the Russian Federation НШ-6760.2018.1
This work was supported by the Russian Foundation for Basic Research (project no. 18-01-00355) and by the Russian Federation President Grant (project no. NSh-6760.2018.1).
Presented: V. V. Kozlov
Received: 27.07.2019
Revised: 27.07.2019
Accepted: 01.11.2019
English version:
Doklady Mathematics, 2020, Volume 101, Issue 1, Pages 66–67
DOI: https://doi.org/10.1134/S1064562420010184
Bibliographic databases:
Document Type: Article
UDC: 519
Language: Russian
Citation: A. M. Raigorodskii, M. Koshelev, “New bounds for the clique-chromatic numbers of Johnson graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020), 78–80; Dokl. Math., 101:1 (2020), 66–67
Citation in format AMSBIB
\Bibitem{RaiKos20}
\by A.~M.~Raigorodskii, M.~Koshelev
\paper New bounds for the clique-chromatic numbers of Johnson graphs
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2020
\vol 490
\pages 78--80
\mathnet{http://mi.mathnet.ru/danma39}
\crossref{https://doi.org/10.31857/S268695432001018X}
\zmath{https://zbmath.org/?q=an:1477.05079}
\elib{https://elibrary.ru/item.asp?id=42579067}
\transl
\jour Dokl. Math.
\yr 2020
\vol 101
\issue 1
\pages 66--67
\crossref{https://doi.org/10.1134/S1064562420010184}
Linking options:
  • https://www.mathnet.ru/eng/danma39
  • https://www.mathnet.ru/eng/danma/v490/p78
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
    Statistics & downloads:
    Abstract page:121
    Full-text PDF :52
    References:15
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024