Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 2016, Volume 52, Issue 4, Pages 64–83 (Mi ppi2222)  
This article is cited in 6 scientific papers (total in 6 papers)

Large Systems

On chromatic numbers of close-to-Kneser distance graphs

A. V. Bobu, A. E. Kupriyanov

Department of Mathematical Statistics and Random Processes, Faculty of Mathematics and Mechanics, Lomonosov Moscow State University, Moscow, Russia
Full-text PDF (264 kB) Citations (6)
References:
PDF
HTML
Abstract: We study a family of distance graphs whose structure is close to that of Kneser graphs. We give new lower and upper bounds on the chromatic numbers of such graphs and consider the question of their interrelation. We also describe the structure of some important independence sets for this family of graphs and explicitly compute their cardinalities.
Funding agency Grant number
Russian Foundation for Basic Research 15-01-03530
Supported in part by the Russian Foundation for Basic Research, project no. 15-01-03530.
Received: 04.02.2016
Revised: 14.05.2016
English version:
Problems of Information Transmission, 2016, Volume 52, Issue 4, Pages 373–390
DOI: https://doi.org/10.1134/S0032946016040050
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.174.7
Language: Russian
Citation: A. V. Bobu, A. E. Kupriyanov, “On chromatic numbers of close-to-Kneser distance graphs”, Probl. Peredachi Inf., 52:4 (2016), 64–83; Problems Inform. Transmission, 52:4 (2016), 373–390
Citation in format AMSBIB
\Bibitem{BobKup16}
\by A.~V.~Bobu, A.~E.~Kupriyanov
\paper On chromatic numbers of close-to-Kneser distance graphs
\jour Probl. Peredachi Inf.
\yr 2016
\vol 52
\issue 4
\pages 64--83
\mathnet{http://mi.mathnet.ru/ppi2222}
\elib{https://elibrary.ru/item.asp?id=29472213}
\transl
\jour Problems Inform. Transmission
\yr 2016
\vol 52
\issue 4
\pages 373--390
\crossref{https://doi.org/10.1134/S0032946016040050}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000392083800005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85008514416}
Linking options:
  • https://www.mathnet.ru/eng/ppi2222
  • https://www.mathnet.ru/eng/ppi/v52/i4/p64
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025