当前位置:
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.)
Minimum Clique-Free Subgraphs of Kneser Graphs
Doklady Mathematics ( IF 0.6 ) Pub Date : 2021-03-10 , DOI: 10.1134/s1064562420060204 S. V. Vahrushev , M. E. Zhukovskii , S. G. Kiselev , A. Yu. Skorkin
中文翻译:
Kneser图的最小无团子图
更新日期:2021-03-10
Doklady Mathematics ( IF 0.6 ) Pub Date : 2021-03-10 , DOI: 10.1134/s1064562420060204 S. V. Vahrushev , M. E. Zhukovskii , S. G. Kiselev , A. Yu. Skorkin
Abstract
The saturation and weak saturation numbers of Kneser graphs with clique patterns are estimated.
中文翻译:
Kneser图的最小无团子图
摘要
估计具有集团模式的Kneser图的饱和度和弱饱和度数。