Asymptotic enumeration of hypergraphs by degree sequence

DOI10.19086/AIC.32357MaRDI QIDQ6347275arXivFDO

Authors Nina Kamčev, Anita Liebenau, Nicholas Wormald

Publication date 18 August 2020

Published in arXiv

Full work available at URL https://doi.org/10.19086/AIC.32357

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Hypergraphs (05C65)

arXiv classification

math.CO

Abstract: We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform hypergraphs on $n$ vertices provided that $$ for a constant $c>0$, and $3leqk<n^C$ for any $C<1/9.$ Our results relate the degree sequence of a random $k$-uniform hypergraph to a simple model of nearly independent binomial random variables, thus extending the recent results for graphs due to the second and third author.

This page was built for publication: Asymptotic enumeration of hypergraphs by degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347275)