k-connectivity in random undirected graphs (Q1059644)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3904624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | k-connectivity in random undirected graphs |
scientific article; zbMATH DE number 3904624 |
Statements
k-connectivity in random undirected graphs (English)
0 references
1985
0 references
It is shown that a random graph \(G_{n,p}\) of Erdős-Renyi type, with \(p\geq c/n\), has a giant k-block almost surely, for any constant \(k>0\). Bounds are given on the distribution of the size of the giant k-block for \(p\geq c\) log n/n.
0 references
probability of connectivity
0 references
random k-blocks
0 references
random graph
0 references
giant k-block
0 references
0 references
0.9563683
0 references
0.9373203
0 references
0.93578655
0 references
0 references
0 references
0 references
0.9268329
0 references
