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


On the Maximal Cut in a Random Hypergraph
Authors:Zakharov  P. A.  Shabanov  D. A.
Affiliation:1.HSE University, 101000, Moscow, Russia
;2.Moscow Institute of Physics and Technology (National Research University), 141701, Dolgoprudnyi, Moscow oblast, Russia
;3.Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991, Moscow, Russia
;
Abstract:Doklady Mathematics - This paper deals with the problem of finding the max-cut for random hypergraphs. We consider the classical binomial model $$H(n,k,p)$$ of a random k-uniform hypergraph on n...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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