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



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






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


Probl. Peredachi Inf., 2015, Volume 51, Issue 2, Pages 86–98 (Mi ppi2172)  

This article is cited in 5 scientific papers (total in 5 papers)

Large Systems

Independence numbers and chromatic numbers of some distance graphs

A. V. Bobu, O. A. Kostina, 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 in $\mathbb R^n$. We present bounds for independence numbers which are asymptotically tight as $n\to\infty$. We substantially improve upper bounds on chromatic numbers of these graphs, and in a number of cases we give explicit constructions of independence sets.

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

English version:
Problems of Information Transmission, 2015, 51:2, 165–176

Bibliographic databases:

UDC: 621.391.1+519.1
Received: 28.05.2014

Citation: A. V. Bobu, O. A. Kostina, A. E. Kupriyanov, “Independence numbers and chromatic numbers of some distance graphs”, Probl. Peredachi Inf., 51:2 (2015), 86–98; Problems Inform. Transmission, 51:2 (2015), 165–176

Citation in format AMSBIB
\Bibitem{BobKosKup15}
\by A.~V.~Bobu, O.~A.~Kostina, A.~E.~Kupriyanov
\paper Independence numbers and chromatic numbers of some distance graphs
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 2
\pages 86--98
\mathnet{http://mi.mathnet.ru/ppi2172}
\elib{http://elibrary.ru/item.asp?id=24959335}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 2
\pages 165--176
\crossref{https://doi.org/10.1134/S0032946015020076}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000357472800007}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84943270513}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2172
  • http://mi.mathnet.ru/eng/ppi/v51/i2/p86

    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, “Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection”, Sb. Math., 207:5 (2016), 652–677  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib
    2. A. V. Bobu, A. E. Kupriyanov, “On chromatic numbers of close-to-Kneser distance graphs”, Problems Inform. Transmission, 52:4 (2016), 373–390  mathnet  crossref  isi  elib
    3. 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
    4. A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “On the Number of Edges in a Uniform Hypergraph With a Range of Permitted Intersections”, Dokl. Math., 96:1 (2017), 354–357  crossref  mathscinet  zmath  isi  scopus
    5. D. A. Zakharov, “O khromaticheskikh chislakh nekotorykh distantsionnykh grafov”, Matem. zametki, 107:2 (2020), 210–220  mathnet  crossref
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:195
    Full text:29
    References:16
    First page:14

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