The number of connected sparsely edged uniform hypergraphs
type: Item
instance of: scholarly article
title: The number of connected sparsely edged uniform hypergraphs
zbMATH Open document ID: 0876.05041
DOI: 10.1016/S0012-365X(96)00076-3
author: Michal Karonski
author: Tomasz Łuczak
published in: Discrete Mathematics
publication date: 1997-11-10T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1047085
zbMATH Keywords: hypergraphs
reviewed by: Edgar M. Palmer
MaRDI profile type: Publication
cites work: Q4769070
cites work: The asymptotic number of labeled connected graphs with a given number of vertices and edges
cites work: Q3344024
cites work: The Evolution of Random Graphs
cites work: Q3682518
cites work: The birth of the giant component
cites work: Probability of Indecomposability of a Random Mapping Function
cites work: On the number of sparse connected graphs
cites work: Cycles in a random graph near the critical point
cites work: The Structure of a Random Graph at the Point of the Phase Transition
cites work: The chromatic number of random graphs at the double-jump threshold
cites work: Q3268814
cites work: The number of connected sparsely edged graphs
cites work: The number of connected sparsely edged graphs. II. Smooth graphs and blocks
cites work: The number of connected sparsely edged graphs. III. Asymptotic results
description: scientific article; zbMATH DE number 1047085