The number of connected sparsely edged uniform hypergraphs

DOI10.1016/S0012-365X(96)00076-3zbMath0876.05041MaRDI QIDQ1363695

Michał Karoński, Tomasz Łuczak

Publication date: 10 November 1997

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

zbMATH Keywords

hypergraphs

Mathematics Subject Classification ID

05C65: Hypergraphs

05C30: Enumeration in graph theory

Related Items

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 Connectedd-Uniform Hypergraphs, On vertex independence number of uniform hypergraphs, Birth and growth of multicyclic components in random hypergraphs, Mixing times for random \(k\)-cycles and coalescence-fragmentation chains, The phase transition in a random hypergraph, Phase transition of random non-uniform hypergraphs, The order of the giant component of random hypergraphs

Cites Work

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