Critical subgraphs of a random graph (Q1305173): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Michael S. O. Molloy / rank | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
| Property / author | |||
| Property / author: Michael S. O. Molloy / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical subgraphs of a random graph |
scientific article |
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
