Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424067 | European Journal of Combinatorics | 2016 | 10 Pages |
Abstract
Let râ¥2 be a fixed integer. For infinitely many n, let k=(k1,â¦,kn) 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 kmax satisfies kmax3=o(M).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vladimir Blinovsky, Catherine Greenhill,