Back
Back
The number of connected sparsely edged uniform hypergraphs
Authors:
- Michał Karoński,
- Tomasz Łuczak
Abstract
Certain families of d-uniform hypergraphs are counted. In particular, the number of connected d-uniform hypergraphs with r vertices and r + k hyperedges, where k = o(log r/ log log r), is found.
- Record ID
- UAM1c17b69fdcfa4c068a4b6babdd8364ed
- Author
- Journal series
- Discrete Mathematics, ISSN 0012-365X
- Issue year
- 1997
- Vol
- 171
- Pages
- 153-167
- ASJC Classification
- ;
- DOI
- DOI:10.1016/S0012-365X(96)00076-3 opening in a new tab
- Language
- en English
- Score (nominal)
- 20
- Score source
- journalList
- Publication indicators
- = 14.000; : 1999 = 0.846; : 2006 = 0.347 (2) - 2007=0.501 (5)
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM1c17b69fdcfa4c068a4b6babdd8364ed/
* 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