k-connectivity in random undirected graphs (Q1059644): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:47, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-connectivity in random undirected graphs |
scientific article |
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
