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


Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
Authors:Svante Janson  Andrzej Ruciński
Institution:1.Department of Mathematics,Uppsala University,Uppsala,Sweden;2.Department of Discrete Mathematics,Adam Mickiewicz University,Poznań,Poland
Abstract:General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph ℋ, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and Schur triples in random subsets of integers. In the second part of the paper we return to the subgraph counts in random graphs and provide upper tail estimates in the rooted case.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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