当前位置:
X-MOL 学术
›
Probl. Inf. Transm.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs
Problems of Information Transmission ( IF 1.2 ) Pub Date : 2023-01-10 , DOI: 10.1134/s0032946022040081 Ya. K. Shubin
中文翻译:
约翰逊图子图中最小边数的下界
更新日期:2023-01-11
Problems of Information Transmission ( IF 1.2 ) Pub Date : 2023-01-10 , DOI: 10.1134/s0032946022040081 Ya. K. Shubin
We prove a new lower bound on the minimum number of edges in subgraphs of Johnson graphs in the general case.
中文翻译:
约翰逊图子图中最小边数的下界
在一般情况下,我们证明了 Johnson 图子图中最小边数的新下界。