Loading [MathJax]/jax/output/SVG/config.js
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, 2015, Volume 51, Issue 2, Pages 86–98 (Mi ppi2172)  
This article is cited in 6 scientific papers (total in 6 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
Full-text PDF (215 kB) Citations (6)
References:
PDF
HTML
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.
Received: 28.05.2014
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 2, Pages 165–176
DOI: https://doi.org/10.1134/S0032946015020076
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
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{https://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{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000357472800007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84943270513}
Linking options:
  • https://www.mathnet.ru/eng/ppi2172
  • https://www.mathnet.ru/eng/ppi/v51/i2/p86
    • This publication is cited in the following 6 articles:
    1. D. A. Zakharov, “Chromatic Numbers of Some Distance Graphs”, Math. Notes, 107:2 (2020), 238–246  mathnet  crossref  crossref  mathscinet  isi  elib
    2. D. Zakharov, “Chromatic numbers of kneser-type graphs”, J. Comb. Theory Ser. A, 172 (2020), 105188  crossref  mathscinet  zmath  isi  scopus
    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. 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  zmath  adsnasa  isi  elib
    6. 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
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:412
    Full-text PDF :96
    References:60
    First page:14
     
      Contact us:
    math-net2025_03@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025