| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427172 | Information Processing Letters | 2013 | 4 Pages |
Abstract
•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.
In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d=d(n)=o(n1/2)d=d(n)=o(n1/2). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andrzej Dudek, Alan Frieze, Andrzej Ruciński, Matas Šileikis,