Degree sequences of sufficiently dense random uniform hypergraphs

Catherine Greenhill, Mikhail Isaev, Tamás Makai +1

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…