Sbornik: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Sb.:
Year:
Volume:
Issue:
Page:
Find




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

Sbornik: Mathematics, 2013, Volume 204, Issue 4, Pages 508–538
DOI: https://doi.org/10.1070/SM2013v204n04ABEH004310 (Mi sm7830) 		 
This article is cited in 21 scientific papers (total in 21 papers)

Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size

E. E. Demekhina, A. M. Raigorodskiiab, O. I. Rubanovab

a M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b Moscow Institute of Physics and Technology (State University)
English version PDF (494 kB) Citations (21) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/SM2013v204n04ABEH004310
Abstract: It is established that there exist sequences of distance graphs $G_n\subset\mathbb R^n$, with chromatic numbers which grow exponentially, but, at the same time, without cliques or cycles of a given size.
Bibliography: 42 titles.
Keywords: distance graph, random graph, chromatic number, clique, cycle.
Funding agency Grant number
Russian Foundation for Basic Research 12-01-00683
Ministry of Education and Science of the Russian Federation НШ-2519.2012.1
Received: 14.12.2010 and 09.12.2011
Bibliographic databases:
Document Type: Article
UDC: 519.112.4+519.174+519.176
MSC: 05C15, 05C35, 05D10
Language: English
Original paper language: Russian
Citation: E. E. Demekhin, A. M. Raigorodskii, O. I. Rubanov, “Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size”, Sb. Math., 204:4 (2013), 508–538
Citation in format AMSBIB
\Bibitem{DemRaiRub13}
\by E.~E.~Demekhin, A.~M.~Raigorodskii, O.~I.~Rubanov
\paper Distance graphs having large chromatic numbers and containing no cliques or cycles of a~given size
\jour Sb. Math.
\yr 2013
\vol 204
\issue 4
\pages 508--538
\mathnet{http://mi.mathnet.ru//eng/sm7830}
\crossref{https://doi.org/10.1070/SM2013v204n04ABEH004310}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3097579}
\zmath{https://zbmath.org/?q=an:1268.05070}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2013SbMat.204..508D}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000320302700003}
\elib{https://elibrary.ru/item.asp?id=19066661}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84888343984}
Linking options:
  • https://www.mathnet.ru/eng/sm7830
  • https://doi.org/10.1070/SM2013v204n04ABEH004310
  • https://www.mathnet.ru/eng/sm/v204/i4/p49
    • This publication is cited in the following 21 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математический сборник Sbornik: Mathematics
    Statistics & downloads:
    Abstract page:766
    Russian version PDF:462
    English version PDF:22
    References:80
    First page:64
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024