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
- No
- 1-3
- Pages
- 153-167
- ASJC Classification
- ;
- DOI
- DOI:10.1016/S0012-365X(96)00076-3 Opening in a new tab
- URL
- https://www.sciencedirect.com/science/article/pii/S0012365X96000763?via%3Dihub Opening in a new tab
- Language
- (en) English
- File
-
- File: 1
- 1-s2.0-S0012365X96000763-main.pdf
-
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 15; = 16; : 1999 = 0.846; : 2006 (2 years) = 0.347 - 2007 (5 years) =0.501
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM1c17b69fdcfa4c068a4b6babdd8364ed/
- URN
urn:amu-prod: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.