The number of connected sparsely edged uniform hypergraphs

DOI10.1016/S0012-365X(96)00076-3MaRDI QIDQ1363695zbMATH OpenFDO

Authors Michal Karonski, Tomasz Łuczak

Publication date 10 November 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)00076-3

zbMATH Keywords

hypergraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65)

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.

Recommendations

• The asymptotic number of connected \(d\)-uniform hypergraphs
• Counting connected graphs and hypergraphs via the probabilistic method
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Counting dense connected hypergraphs via the probabilistic method
• Counting connected hypergraphs via the probabilistic method

Cites work

• Cycles in a random graph near the critical point
• scientific article; zbMATH DE number 3151315 (Why is no real title available?)
• scientific article; zbMATH DE number 3878974 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3443677 (Why is no real title available?)
• On the number of sparse connected graphs
• Probability of Indecomposability of a Random Mapping Function
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The birth of the giant component
• The chromatic number of random graphs at the double-jump threshold
• The Evolution of Random Graphs
• The number of connected sparsely edged graphs
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• The number of connected sparsely edged graphs. III. Asymptotic results
• The Structure of a Random Graph at the Point of the Phase Transition

Cited in

(14)

• The phase transition in a random hypergraph
• Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
• The counting series for unlabeled true strict (d)-connected acyclic hypergraphs
• The order of the giant component of random hypergraphs
• On the number of sparse connected graphs
• On vertex independence number of uniform hypergraphs
• Subcritical random hypergraphs, high-order components, and hypertrees
• Counting connected hypergraphs via the probabilistic method
• Local limit theorems for the giant component of random hypergraphs
• The asymptotic number of connected \(d\)-uniform hypergraphs
• Counting connected graphs and hypergraphs via the probabilistic method
• Birth and growth of multicyclic components in random hypergraphs
• Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
• A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges

This page was built for publication: The number of connected sparsely edged uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363695)