The number of connected sparsely edged uniform hypergraphs

DOI10.1016/S0012-365X(96)00076-3zbMATH Open0876.05041MaRDI QIDQ1363695FDOQ1363695

Authors: Michal Karonski, Tomasz Łuczak 

Publication date: 10 November 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• 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
• The order of the giant component of random hypergraphs
• Local limit theorems for the giant component of random hypergraphs
• Counting connected hypergraphs via the probabilistic method
• On vertex independence number of uniform hypergraphs
• Phase transition of random non-uniform hypergraphs
• Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
• 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
• Subcritical random hypergraphs, high-order components, and hypertrees
• The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs
• The phase transition in a random hypergraph
• On the number of sparse connected graphs

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)