科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let r >= 2 be a fixed integer. For infinitely many n, let k = (k(1), ... , k(n)) be a vector of nonnegative integers such that their sum M is divisible by r. We present an asymptotic enumeration formula for simple r-uniform hypergraphs with degree sequence k. (Here "simple" means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree k(max) satisfies k(max)(3) = o(M).
- 出版日期2016-1
