On the strength of connectedness of a random hypergraph

zbMath1310.05186arXiv1409.1489MaRDI QIDQ2341061

Daniel J. Poole

Publication date: 22 April 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.1489

File on IPFS

zbMATH Keywords

vertex connectivityrandom hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Connectivity (05C40)

Related Items (12)

Threshold and hitting time for high-order connectedness in random hypergraphs ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Connectivity of the linear uniform hypergraph process ⋮ Homological connectedness of random hypergraphs ⋮ Unnamed Item ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Connectivity of random hypergraphs with a given hyperedge size distribution ⋮ The hitting time of clique factors ⋮ Cohomology groups of non-uniform random simplicial complexes ⋮ Vanishing of cohomology groups of random simplicial complexes ⋮ Loose cores and cycles in random hypergraphs ⋮ Model-based clustering for random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Degree sequences of random graphs
• On the strength of connectedness of a random graph
• The Strength of Connectivity of a Random Graph
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

This page was built for publication: On the strength of connectedness of a random hypergraph