Approximate counting of regular hypergraphs

Abstract

In this paper we asymptotically count $d$-regular $k$-uniform hypergraphs on $n$ vertices, provided $k$ is fixed and $d=d(n)=o(n^{1/2})$. In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.

12 pp

References in corpus (1)

• Asymptotic enumeration of sparse uniform hypergraphs with given degrees

Cited by in corpus (5)

• Asymptotic enumeration of sparse uniform hypergraphs with given degrees
• Loose Hamilton Cycles in Regular Hypergraphs
• Counting Integer Points in Multi-Index Transportation Polytopes
• Asymptotic enumeration of hypergraphs by degree sequence
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum