10.1184/R1/6476885.v1 Andrzej Dudek Andrzej Dudek Alan Frieze Alan Frieze Andrzej Rucinski Andrzej Rucinski Matas Sileikis Matas Sileikis Approximate counting of regular hypergraphs Carnegie Mellon University 2013 Combinatorial problems Hypergraphs Switching 2013-06-26 00:00:00 Journal contribution https://kilthub.cmu.edu/articles/journal_contribution/Approximate_counting_of_regular_hypergraphs/6476885 <p>In this paper we asymptotically count <em>d</em>-regular <em>k</em>-uniform hypergraphs on <em>n</em> vertices, provided <em>k </em> is fixed and d=d(n)=o(n<sup>1/2</sup>). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.</p>