Degree sequences of sufficiently dense random uniform hypergraphs
Degree sequences of sufficiently dense random uniform hypergraphs
Abstract We find an asymptotic enumeration formula for the number of simple $r$ -uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations. We give sufficient conditions on the degree sequence …