The chromatic number of random graphs (Q5905438): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q93437489, #quickstatements; #temporary_batch_1707161894653 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:36, 5 March 2024
scientific article; zbMATH DE number 25759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic number of random graphs |
scientific article; zbMATH DE number 25759 |
Statements
The chromatic number of random graphs (English)
0 references
27 June 1992
0 references
An asymptotic concentration interval is given for the chromatic number of a Bernoulli graph \(G(n,p)\) when \(np\) is sufficiently large and \(p\to 0\).
0 references
random graphs
0 references
chromatic number
0 references
Bernoulli graph
0 references
