Matematicheskie Zametki
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. Zametki:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Zametki, 2010, Volume 87, Issue 3, Pages 417–428
DOI: https://doi.org/10.4213/mzm5187 (Mi mzm5187) 		 
This article is cited in 10 scientific papers (total in 10 papers)

Distance Graphs with Large Chromatic Number and without Large Cliques

A. M. Raigorodskii, O. I. Rubanov

M. V. Lomonosov Moscow State University
Full-text PDF (563 kB) Citations (10)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm5187
Abstract: The present paper is devoted to the study of the properties of distance graphs in Euclidean space. We prove, in particular, the existence of distance graphs with chromatic number of exponentially large dimension and without cliques of dimension 6. In addition, under a given constraint on the cardinality of the maximal clique, we search for distance graphs with extremal large values of the chromatic number. The resulting estimates are best possible within the framework of the proposed method, which combines probabilistic techniques with the linear-algebraic approach.
Keywords: distance graph, chromatic number, clique, Stirling's formula, Euclidean space, probability space, random variable, expectation.
Received: 04.06.2008
English version:
Mathematical Notes, 2010, Volume 87, Issue 3, Pages 392–402
DOI: https://doi.org/10.1134/S0001434610030119
Bibliographic databases:
Document Type: Article
UDC: 519.174
Language: Russian
Citation: A. M. Raigorodskii, O. I. Rubanov, “Distance Graphs with Large Chromatic Number and without Large Cliques”, Mat. Zametki, 87:3 (2010), 417–428; Math. Notes, 87:3 (2010), 392–402
Citation in format AMSBIB
\Bibitem{RaiRub10}
\by A.~M.~Raigorodskii, O.~I.~Rubanov
\paper Distance Graphs with Large Chromatic Number and without Large Cliques
\jour Mat. Zametki
\yr 2010
\vol 87
\issue 3
\pages 417--428
\mathnet{http://mi.mathnet.ru/mzm5187}
\crossref{https://doi.org/10.4213/mzm5187}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2761598}
\zmath{https://zbmath.org/?q=an:05791062}
\elib{https://elibrary.ru/item.asp?id=15336424}
\transl
\jour Math. Notes
\yr 2010
\vol 87
\issue 3
\pages 392--402
\crossref{https://doi.org/10.1134/S0001434610030119}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000279034600011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77954020616}
Linking options:
  • https://www.mathnet.ru/eng/mzm5187
  • https://doi.org/10.4213/mzm5187
  • https://www.mathnet.ru/eng/mzm/v87/i3/p417
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:642
    Full-text PDF :225
    References:53
    First page:20
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024