|
Large Systems
Lower bound on the minimum number of edges in subgraphs of Johnson graphs
Ya. K. Shubin Department of Mathematical Statistics and Random Processes,
Faculty of Mechanics and Mathematics,
Lomonosov Moscow State University, Moscow, Russia
Abstract:
We prove a new lower bound on the minimum number of edges in subgraphs of Johnson graphs in the general case.
Keywords:
Johnson graphs, distance graphs.
Received: 18.10.2022 Revised: 04.11.2022 Accepted: 05.11.2022
Citation:
Ya. K. Shubin, “Lower bound on the minimum number of edges in subgraphs of Johnson graphs”, Probl. Peredachi Inf., 58:4 (2022), 95–102; Problems Inform. Transmission, 58:4 (2022), 382–388
Linking options:
https://www.mathnet.ru/eng/ppi2386 https://www.mathnet.ru/eng/ppi/v58/i4/p95
|
|