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, 2021, Volume 57, Issue 4, Pages 79–86
DOI: https://doi.org/10.31857/S0555292321040070 (Mi ppi2357) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Large Systems

New Turán type bounds for Johnson graphs

N. A. Dubinin

Moscow Institute of Physics and Technology (National Research University), Moscow, Russia
Full-text PDF (308 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0555292321040070
Abstract: We obtain a new bound on the number of edges in induced subgraphs of Johnson graphs.
Keywords: Turán theorem, distance graphs, Johnson graphs.
Received: 10.05.2021
Revised: 04.09.2021
Accepted: 05.09.2021
English version:
Problems of Information Transmission, 2021, Volume 57, Issue 4, Pages 373–379
DOI: https://doi.org/10.1134/S0032946021040074
Bibliographic databases:
Document Type: Article
UDC: 621.391 : 519.176
Language: Russian
Citation: N. A. Dubinin, “New Turán type bounds for Johnson graphs”, Probl. Peredachi Inf., 57:4 (2021), 79–86; Problems Inform. Transmission, 57:4 (2021), 373–379
Citation in format AMSBIB
\Bibitem{Dub21}
\by N.~A.~Dubinin
\paper New Tur\'an type bounds for Johnson graphs
\jour Probl. Peredachi Inf.
\yr 2021
\vol 57
\issue 4
\pages 79--86
\mathnet{http://mi.mathnet.ru/ppi2357}
\crossref{https://doi.org/10.31857/S0555292321040070}
\transl
\jour Problems Inform. Transmission
\yr 2021
\vol 57
\issue 4
\pages 373--379
\crossref{https://doi.org/10.1134/S0032946021040074}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000742673500007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85122992381}
Linking options:
  • https://www.mathnet.ru/eng/ppi2357
  • https://www.mathnet.ru/eng/ppi/v57/i4/p79
    • This publication is cited in the following 2 articles:
    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:126
    Full-text PDF :8
    References:30
    First page:15
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025