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. Neustroeva a email , A. M. Raigorodskii abcd email 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
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.
Received: 08.01.2023
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
Linking options:
https://www.mathnet.ru/eng/mzm13720 https://doi.org/10.4213/mzm13720 https://www.mathnet.ru/eng/mzm/v115/i2/p266
Statistics & downloads :
Abstract page: 218 Full-text PDF : 2 Russian version HTML: 7 References: 36 First page: 26