Size and connectivity of the \(k\)-core of a random graph (Q1179277)
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 24183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Size and connectivity of the \(k\)-core of a random graph |
scientific article; zbMATH DE number 24183 |
Statements
Size and connectivity of the \(k\)-core of a random graph (English)
0 references
26 June 1992
0 references
The \(k\)-core of a graph is the maximal subgraph with no degree below \(k\). Asymptotic estimates are given of the size and connectivity of the \(k\)- core of a Bernoulli graph.
0 references
connectivity
0 references
random graph
0 references
0.8627261519432068
0 references
0.8371500372886658
0 references
0.8289806246757507
0 references
0.823257565498352
0 references
