Critical subgraphs of a random graph (Q1305173)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Critical subgraphs of a random graph |
scientific article; zbMATH DE number 1345965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical subgraphs of a random graph |
scientific article; zbMATH DE number 1345965 |
Statements
Critical subgraphs of a random graph (English)
0 references
16 January 2000
0 references
Consider \(n\) vertices and a graph process obtained by successively inserting edges at random. The threshold for a graph that is almost surely \(k\)-colorable is compared to the threshold for the appearance of a \(k\)-core.
0 references
critical subgraphs
0 references
random graph
0 references
chromatic number
0 references
