Approximate counting of regular hypergraphs

Authors:
Andrzej Dudek;Alan Frieze;Andrzej Ruciński;Matas Šileikis
Affiliations:
Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA;Department of Discrete Mathematics, Adam Mickiewicz University, Poznań, Poland;Department of Mathematics, Uppsala University, Sweden
Venue:
Information Processing Letters
Year:
2013

Citing 2
Cited 0

Uniform generation of random regular graphs of moderate degree

Journal of Algorithms
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.