Approximate counting of regular hypergraphs

作者：Dudek Andrzej^*; Frieze Alan; Rucinski Andrzej; Sileikis Matas

来源：Information Processing Letters, 2013, 113(19-21): 785-788.

DOI：10.1016/j.ipl.2013.07.018

• Combinatorial problems
• Hypergraphs
• Switching

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

• 出版日期2013-10