首页 | 本学科首页   官方微博 | 高级检索  
     


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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号