Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs |
| |
Authors: | Shubin Ya. K. |
| |
Affiliation: | 1.Department of Mathematical Statistics and Random Processes, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia ; |
| |
Abstract: | Problems of Information Transmission - We prove a new lower bound on the minimum number of edges in subgraphs of Johnson graphs in the general case. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|