Approximate counting of regular hypergraphs
We approximately count regular and uniform hypergraphs. Proofs are based on a configuration model. We extend to hypergraphs a switching technique of McKay and Wormald.
hypergraphs switching combinatorial problems