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


On the Strong Chromatic Number of Random Hypergraphs
Authors:Matveeva  T. G.  Khuzieva  A. E.  Shabanov  D. A.
Affiliation:1.Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991, Moscow, Russia
;2.HSE University, 101000, Moscow, Russia
;3.Moscow Institute of Physics and Technology (National Research University), 141701, Dolgoprudnyi, Moscow oblast, Russia
;
Abstract:
Doklady Mathematics - We study the probability threshold for the property of strong colorability with a given number of colors of a random $$k$$ -uniform hypergraph in the binomial model...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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