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


Minimum Clique-Free Subgraphs of Kneser Graphs
Authors:Vahrushev  S. V.  Zhukovskii  M. E.  Kiselev  S. G.  Skorkin  A. Yu.
Affiliation:1.Moscow Institute of Physics and Technology (National Research University), 141701, Dolgoprudnyi, Moscow oblast, Russia
;2.Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, 644043, Omsk, Russia
;3.Caucasus Mathematical Center, Adyghe State University, 385000, Maykop, Republic of Adygea, Russia
;4.Russian Presidential Academy of National Economy and Public Administration, 119571, Moscow, Russia
;
Abstract:Doklady Mathematics - The saturation and weak saturation numbers of Kneser graphs with clique patterns are estimated.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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