4,012 research outputs found
On the strength of connectedness of a random hypergraph
Bollob\'{a}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 Comment: 16 pages, minor revisions from first draf
- β¦