Back
Back
Approximate counting of regular hypergraphs
Authors:
- Andrzej Dudek,
- Alan Frieze,
- Andrzej Ruciński,
- Matas Šileikis
Abstract
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). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald. © 2013 Elsevier B.V.
- Record ID
- UAM53eb269dfaeb4dbfa2fa4acdcdb4333c
- Author
- Journal series
- Information Processing Letters, ISSN 0020-0190
- Issue year
- 2013
- Vol
- 113
- Pages
- 785-788
- ASJC Classification
- ; ; ;
- DOI
- DOI:10.1016/j.ipl.2013.07.018 opening in a new tab
- Language
- en English
- Score (nominal)
- 20
- Score source
- journalList
- Score
- Publication indicators
- = 5.000; : 2013 = 0.973; : 2013 = 0.479 (2) - 2013=0.595 (5)
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM53eb269dfaeb4dbfa2fa4acdcdb4333c/
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perishopening in a new tab system.
Back