Abstract
Bollobás and Thomason (1985) proved that for each , with high probability, the random graph process, where edges are added to vertex set uniformly at random one after another, is such that the stopping time of having minimal degree is equal to the stopping time of becoming -(vertex-)connected. We extend this result to the -uniform random hypergraph process, where and are fixed. Consequently, for and , the probability that the random hypergraph models and are -connected tends to
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.