Dudek, Andrzej Frieze, Alan Rucinski, Andrzej Sileikis, Matas Approximate counting of regular hypergraphs <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> Combinatorial problems;Hypergraphs;Switching 2013-06-26
    https://kilthub.cmu.edu/articles/journal_contribution/Approximate_counting_of_regular_hypergraphs/6476885
10.1184/R1/6476885.v1