Size and connectivity of the \(k\)-core of a random graph (Q1179277): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/dm/Luczak91, #quickstatements; #temporary_batch_1731508824982 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57259025 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198785 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3682518 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3344024 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3286850 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3778794 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The chromatic number of random graphs at the double-jump threshold / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dm/Luczak91 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 13 November 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
