The chromatic number of random graphs (Q5905438): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The chromatic number of random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the independence number of random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expose-and-merge exploration and the chromatic number of a random graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) / rank | |||
Normal rank | |||
Latest revision as of 14:01, 15 May 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
