file.pdf (343.5 kB)
Approximate counting of regular hypergraphs
journal contribution
posted on 2013-06-26, 00:00 authored by Andrzej Dudek, Alan FriezeAlan Frieze, Andrzej Rucinski, Matas SileikisIn this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d=d(n)=o(n1/2). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.