RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
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


Mat. Zametki, 2017, Volume 101, Issue 3, Pages 430–445 (Mi mz11149)  

This article is cited in 7 scientific papers (total in 7 papers)

Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth

A. Sagdeev


Abstract: We obtain some specific exponential lower bounds for the chromatic numbers of distance graphs with large girth.

Keywords: chromatic number, distance graph, Frankl–Rödl theorem.

DOI: https://doi.org/10.4213/mzm11149

Full text: PDF file (523 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Mathematical Notes, 2017, 101:3, 515–528

Bibliographic databases:

UDC: 519.1
Received: 26.03.2016

Citation: A. Sagdeev, “Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth”, Mat. Zametki, 101:3 (2017), 430–445; Math. Notes, 101:3 (2017), 515–528

Citation in format AMSBIB
\Bibitem{Sag17}
\by A.~Sagdeev
\paper Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth
\jour Mat. Zametki
\yr 2017
\vol 101
\issue 3
\pages 430--445
\mathnet{http://mi.mathnet.ru/mz11149}
\crossref{https://doi.org/10.4213/mzm11149}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3635434}
\elib{http://elibrary.ru/item.asp?id=28405156}
\transl
\jour Math. Notes
\yr 2017
\vol 101
\issue 3
\pages 515--528
\crossref{https://doi.org/10.1134/S0001434617030130}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000401454600013}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018851554}


Linking options:
  • http://mi.mathnet.ru/eng/mz11149
  • https://doi.org/10.4213/mzm11149
  • http://mi.mathnet.ru/eng/mz/v101/i3/p430

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. Sagdeev, “The Chromatic Number of Space with Forbidden Regular Simplex”, Math. Notes, 102:4 (2017), 541–546  mathnet  crossref  crossref  mathscinet  isi  elib
    2. Prosanov R.I., Raigorodskii A.M., Sagdeev A.A., “Improvements of the Frankl-Rodl Theorem and Geometric Consequences”, Dokl. Math., 96:1 (2017), 336–338  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. R. I. Prosanov, “Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets”, Math. Notes, 103:2 (2018), 243–250  mathnet  crossref  crossref  isi  elib
    5. A. A. Sagdeev, “Improved Frankl–Rödl theorem and some of its geometric consequences”, Problems Inform. Transmission, 54:2 (2018), 139–164  mathnet  crossref  isi  elib
    6. A. Sagdeev, “On the Frankl–Rödl theorem”, Izv. Math., 82:6 (2018), 1196–1224  mathnet  crossref  crossref  adsnasa  isi  elib
    7. R. I. Prosanov, “Kontrprimery k gipoteze Borsuka, imeyuschie bolshoi obkhvat”, Matem. zametki, 105:6 (2019), 890–898  mathnet  crossref
  • Математические заметки Mathematical Notes
    Number of views:
    This page:189
    References:24
    First page:19

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020