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.

UDC: 621.391 : 519.176

Received: 18.10.2022
Revised: 04.11.2022
Accepted: 05.11.2022

DOI: 10.31857/S0555292322040088

 English version: Problems of Information Transmission, 2022, 58:4, 382–388