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


Probl. Peredachi Inf., 2016, Volume 52, Issue 4, Pages 64–83 (Mi ppi2222)  

This article is cited in 3 scientific papers (total in 3 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

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.


Full text: PDF file (264 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2016, 52:4, 373–390

Bibliographic databases:

UDC: 621.391.1+519.174.7
Received: 04.02.2016
Revised: 14.05.2016

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{http://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{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000392083800005}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85008514416}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2222
  • http://mi.mathnet.ru/eng/ppi/v52/i4/p64

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “On the number of edges of a uniform hypergraph with a range of allowed intersections”, Problems Inform. Transmission, 53:4 (2017), 319–342  mathnet  crossref  isi  elib
    2. A. M. Raigorodskii, D. D. Cherkashin, “Ekstremalnye zadachi v raskraskakh gipergrafov”, UMN, 75:1(451) (2020), 95–154  mathnet  crossref
    3. A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “Ob odnom obobschenii knezerovskikh grafov”, Matem. zametki, 107:3 (2020), 351–365  mathnet
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:167
    Full text:6
    References:21
    First page:13

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020