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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya: Mathematics, 2018, Volume 82, Issue 6, Pages 1196–1224
DOI: https://doi.org/10.1070/IM8630 (Mi im8630) 		 
This article is cited in 12 scientific papers (total in 12 papers)

On the Frankl–Rödl theorem

A. Sagdeev

Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
English version PDF (413 kB) Citations (12) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/IM8630
Abstract: In this paper we considerably strengthen the currently known explicit exponential lower bound for the chromatic number of a Euclidean space with a forbidden regular simplex. We also strengthen the exponential lower bound for the chromatic numbers of distance graphs with large girth.
Keywords: Frankl–Rödl theorem, Euclidean Ramsey theory, distance graph, chromatic number, girth.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00355
Ministry of Education and Science of the Russian Federation НШ-6760.2018.1
This paper was written with the partial financial support of the Russian Foundation for Basic Research (grant no. 18-01-00355) and that of the grant in support of leading scientific schools no. NSh-6760.2018.1.
Received: 18.11.2016
Revised: 09.04.2018
Bibliographic databases:
Document Type: Article
UDC: 517
MSC: 05C15, 05C12, 05D10
Language: English
Original paper language: Russian
Citation: A. Sagdeev, “On the Frankl–Rödl theorem”, Izv. Math., 82:6 (2018), 1196–1224
Citation in format AMSBIB
\Bibitem{Sag18}
\by A.~Sagdeev
\paper On the Frankl--R\"odl theorem
\jour Izv. Math.
\yr 2018
\vol 82
\issue 6
\pages 1196--1224
\mathnet{http://mi.mathnet.ru//eng/im8630}
\crossref{https://doi.org/10.1070/IM8630}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3881768}
\zmath{https://zbmath.org/?q=an:1404.05058}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2018IzMat..82.1196S}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000454805800005}
\elib{https://elibrary.ru/item.asp?id=36448785}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85060148447}
Linking options:
  • https://www.mathnet.ru/eng/im8630
  • https://doi.org/10.1070/IM8630
  • https://www.mathnet.ru/eng/im/v82/i6/p128
    • This publication is cited in the following 12 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия Российской академии наук. Серия математическая Izvestiya: Mathematics
    Statistics & downloads:
    Abstract page:418
    Russian version PDF:50
    English version PDF:20
    References:48
    First page:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024