Loading [MathJax]/jax/output/SVG/config.js
Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 2015, Volume 51, Issue 4, Pages 71–77 (Mi ppi2188)  
This article is cited in 6 scientific papers (total in 6 papers)

Large Systems

A new estimate for the number of edges in induced subgraphs of a special distance graph

Ph. A. Pushnyakov

Moscow Institute of Physics and Technology (State University), Moscow, Russia
Full-text PDF (168 kB) Citations (6)
References:
PDF
HTML
Abstract: We obtain new bounds for the number of edges in induced subgraphs of a special distance graph.
Received: 29.04.2015
Revised: 26.06.2015
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 4, Pages 371–377
DOI: https://doi.org/10.1134/S0032946015040067
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
Citation: Ph. A. Pushnyakov, “A new estimate for the number of edges in induced subgraphs of a special distance graph”, Probl. Peredachi Inf., 51:4 (2015), 71–77; Problems Inform. Transmission, 51:4 (2015), 371–377
Citation in format AMSBIB
\Bibitem{Pus15}
\by Ph.~A.~Pushnyakov
\paper A new estimate for the number of edges in induced subgraphs of a~special distance graph
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 4
\pages 71--77
\mathnet{http://mi.mathnet.ru/ppi2188}
\elib{https://elibrary.ru/item.asp?id=26845954}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 4
\pages 371--377
\crossref{https://doi.org/10.1134/S0032946015040067}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000367604200006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84952913852}
Linking options:
  • https://www.mathnet.ru/eng/ppi2188
  • https://www.mathnet.ru/eng/ppi/v51/i4/p71
    • This publication is cited in the following 6 articles:
    1. Ya. K. Shubin, “On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs”, Math. Notes, 111:6 (2022), 961–969  mathnet  crossref  crossref
    2. N. A. Dubinin, “New Turán type bounds for Johnson graphs”, Problems Inform. Transmission, 57:4 (2021), 373–379  mathnet  crossref  crossref  isi
    3. 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
    4. Ph. A. Pushnyakov, “The Number of Edges in Induced Subgraphs of Some Distance Graphs”, Math. Notes, 105:4 (2019), 582–591  mathnet  crossref  crossref  mathscinet  isi  elib
    5. 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  mathscinet  isi  elib
    6. L. E. Shabanov, A. M. Raigorodskii, “Turan-Type Bounds for Distance Graphs”, Dokl. Math., 96:1 (2017), 351–353  crossref  mathscinet  zmath  isi  scopus
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:369
    Full-text PDF :68
    References:84
    First page:35
     
      Contact us:
    math-net2025_04@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025