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

Matematicheskie Zametki, 2024, Volume 115, Issue 2, Pages 266–275
DOI: https://doi.org/10.4213/mzm13720 (Mi mzm13720) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Estimates of the Number of Edges in Subgraphs of Johnson Graphs

E. A. Neustroevaa, A. M. Raigorodskiiabcd

a Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
b Lomonosov Moscow State University
c Caucasus Mathematical Center, Adyghe State University, Maikop
d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude
Full-text PDF (552 kB) First page Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm13720
Abstract: We consider special distance graphs and estimate the number of edges in their subgraphs. The estimates obtained improve some known results.
Keywords: distance graph, Johnson graph, Turan's theorem, number of edges of a subgraph.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation НШ-775.2022.1.1
This work was supported by the program “Leading Scientific Schools” under grant NSh-775.2022.1.1.
Received: 08.01.2023
English version:
Mathematical Notes, 2024, Volume 115, Issue 2, Pages 223–231
DOI: https://doi.org/10.1134/S0001434624010218
Bibliographic databases:
Document Type: Article
UDC: 519
MSC: 05C35
Language: Russian
Citation: E. A. Neustroeva, A. M. Raigorodskii, “Estimates of the Number of Edges in Subgraphs of Johnson Graphs”, Mat. Zametki, 115:2 (2024), 266–275; Math. Notes, 115:2 (2024), 223–231
Citation in format AMSBIB
\Bibitem{NeuRai24}
\by E.~A.~Neustroeva, A.~M.~Raigorodskii
\paper Estimates of the Number of Edges in Subgraphs of Johnson Graphs
\jour Mat. Zametki
\yr 2024
\vol 115
\issue 2
\pages 266--275
\mathnet{http://mi.mathnet.ru/mzm13720}
\crossref{https://doi.org/10.4213/mzm13720}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4734358}
\transl
\jour Math. Notes
\yr 2024
\vol 115
\issue 2
\pages 223--231
\crossref{https://doi.org/10.1134/S0001434624010218}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85190897616}
Linking options:
  • https://www.mathnet.ru/eng/mzm13720
  • https://doi.org/10.4213/mzm13720
  • https://www.mathnet.ru/eng/mzm/v115/i2/p266
    • This publication is cited in the following 1 articles:
    1. N. A. Dubinin, E. A. Neustroeva, A. M. Raigorodskii, Ya. K. Shubin, “Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph”, Sb. Math., 215:5 (2024), 634–657  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:290
    Full-text PDF :3
    Russian version HTML:8
    References:50
    First page:37
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025