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, 2016, Volume 99, Issue 4, Pages 550–558 (Mi mz10745)  

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

On the Number of Edges in Induced Subgraphs of a Special Distance Graph

Ph. Pushnyakov

Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region

Abstract: We obtain new estimates for the number of edges in induced subgraphs of a special distance graph.

Keywords: distance graph, clique, cycle, coloring, Borsuk problem.

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

Full text: PDF file (466 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 2016, 99:4, 545–551

Bibliographic databases:

UDC: 519.176
Received: 26.03.2015
Revised: 01.07.2015

Citation: Ph. Pushnyakov, “On the Number of Edges in Induced Subgraphs of a Special Distance Graph”, Mat. Zametki, 99:4 (2016), 550–558; Math. Notes, 99:4 (2016), 545–551

Citation in format AMSBIB
\Bibitem{Pus16}
\by Ph.~Pushnyakov
\paper On the Number of Edges in Induced Subgraphs of a Special Distance Graph
\jour Mat. Zametki
\yr 2016
\vol 99
\issue 4
\pages 550--558
\mathnet{http://mi.mathnet.ru/mz10745}
\crossref{https://doi.org/10.4213/mzm10745}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3507419}
\elib{https://elibrary.ru/item.asp?id=25707702}
\transl
\jour Math. Notes
\yr 2016
\vol 99
\issue 4
\pages 545--551
\crossref{https://doi.org/10.1134/S0001434616030275}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000376295200027}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84969849393}


Linking options:
  • http://mi.mathnet.ru/eng/mz10745
  • https://doi.org/10.4213/mzm10745
  • http://mi.mathnet.ru/eng/mz/v99/i4/p550

    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. Ph. A. Pushnyakov, “A new estimate for the number of edges in induced subgraphs of a special distance graph”, Problems Inform. Transmission, 51:4 (2015), 371–377  mathnet  crossref  isi  elib
    2. S. G. Kiselev, A. M. Raigorodskii, “On the chromatic number of a random subgraph of the Kneser graph”, Dokl. Math., 96:2 (2017), 475–476  crossref  mathscinet  zmath  isi  scopus
    3. Ph. A. Pushnyakov, “The Number of Edges in Induced Subgraphs of Some Distance Graphs”, Math. Notes, 105:4 (2019), 582–591  mathnet  crossref  crossref  isi  elib
    4. M. M. Pyaderkin, “On Threshold Probability for the Stability of Independent Sets in Distance Graphs”, Math. Notes, 106:2 (2019), 274–285  mathnet  crossref  crossref  isi  elib
    5. Ph. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the Number of Edges in Special Subgraphs of a Distance Graph”, Math. Notes, 107:2 (2020), 322–332  mathnet  crossref  crossref  isi  elib
  • Математические заметки Mathematical Notes
    Number of views:
    This page:180
    Full text:15
    References:44
    First page:41

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