Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ipl.2013.07.018 | Inf. Process. Lett. |
Keywords | Field | DocType |
n vertex,d-regular k-uniform hypergraphs,approximate counting,regular hypergraphs,hypergraphs,switching,mathematics | Discrete mathematics,Combinatorics,Vertex (geometry),Constraint graph,Mathematics | Journal |
Volume | Issue | ISSN |
113 | 19-21 | 0020-0190 |
Citations | PageRank | References |
2 | 0.40 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrzej Dudek | 1 | 114 | 23.10 |
| Alan M. Frieze | 2 | 4837 | 787.00 |
| Andrzej Ruciński | 3 | 420 | 51.89 |
| Matas Sileikis | 4 | 6 | 3.15 |