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, 2009, Volume 200, Issue 12, Pages 1789–1806
DOI: https://doi.org/10.1070/SM2009v200n12ABEH004059 (Mi sm6373) 		 
This article is cited in 19 scientific papers (total in 19 papers)

On the Ramsey numbers for complete distance graphs with vertices in $\{0,1\}^n$

K. A. Mikhailov, A. M. Raigorodskii

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
English version PDF (320 kB) Citations (19)
References:
PDF
HTML
DOI: https://doi.org/10.1070/SM2009v200n12ABEH004059
Abstract: A new problem of Ramsey type is posed for complete distance graphs in $\mathbb R^n$ with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdős-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem.
Bibliography: 15 titles.
Keywords: Ramsey numbers, distance graphs, chromatic number.
Received: 04.06.2008
Russian version:
Matematicheskii Sbornik, 2009, Volume 200, Number 12, Pages 63–80
DOI: https://doi.org/10.4213/sm6373
Bibliographic databases:
UDC: 519.112.4+519.174
MSC: Primary 05C55; Secondary 05C15, 05C80
Language: English
Original paper language: Russian
Citation: K. A. Mikhailov, A. M. Raigorodskii, “On the Ramsey numbers for complete distance graphs with vertices in $\{0,1\}^n$”, Mat. Sb., 200:12 (2009), 63–80; Sb. Math., 200:12 (2009), 1789–1806
Citation in format AMSBIB
\Bibitem{MikRai09}
\by K.~A.~Mikhailov, A.~M.~Raigorodskii
\paper On the Ramsey numbers for complete distance graphs with vertices in~$\{0,1\}^n$
\jour Mat. Sb.
\yr 2009
\vol 200
\issue 12
\pages 63--80
\mathnet{http://mi.mathnet.ru/sm6373}
\crossref{https://doi.org/10.4213/sm6373}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2604537}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2009SbMat.200.1789M}
\elib{https://elibrary.ru/item.asp?id=19066101}
\transl
\jour Sb. Math.
\yr 2009
\vol 200
\issue 12
\pages 1789--1806
\crossref{https://doi.org/10.1070/SM2009v200n12ABEH004059}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000275236600009}
\elib{https://elibrary.ru/item.asp?id=15310678}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77149165996}
Linking options:
  • https://www.mathnet.ru/eng/sm6373
  • https://doi.org/10.1070/SM2009v200n12ABEH004059
  • https://www.mathnet.ru/eng/sm/v200/i12/p63
    • This publication is cited in the following 19 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:836
    Russian version PDF:338
    English version PDF:9
    References:112
    First page:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024