Size and connectivity of the \(k\)-core of a random graph (Q1179277): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57259025, #quickstatements; #temporary_batch_1708298810402 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:34, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Size and connectivity of the \(k\)-core of a random graph |
scientific article |
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
