当前位置：
X-MOL 学术
›
Dokl. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Estimate of the Number of Edges in Subgraphs of a Johnson Graph
Doklady Mathematics ( IF 0.6 ) Pub Date : 2021-09-22 , DOI: 10.1134/s106456242104013x F. A. Pushnyakov 1 , A. M. Raigorodskii 1, 2, 3, 4
中文翻译：
约翰逊图子图中边数的估计
更新日期：2021-09-23
Doklady Mathematics ( IF 0.6 ) Pub Date : 2021-09-22 , DOI: 10.1134/s106456242104013x F. A. Pushnyakov 1 , A. M. Raigorodskii 1, 2, 3, 4
Affiliation
Abstract
New estimates for the minimum number of edges in subgraphs of a Johnson graph are obtained.
中文翻译：
约翰逊图子图中边数的估计
摘要
获得了约翰逊图子图中最小边数的新估计值。
京公网安备 11010802027423号