Approximate counting of regular hypergraphs

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\mathrm{/}2})$. In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.