A note on the sharp concentration of the chromatic number of random graphs (Q1180430): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01205080 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060664509 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the sharp concentration of the chromatic number of random graphs |
scientific article |
Statements
A note on the sharp concentration of the chromatic number of random graphs (English)
0 references
27 June 1992
0 references
An asymptotic concentration interval of unit length is given for the chromatic number of a Bernoulli graph \(G(n,p)\) when \(p\) is sufficiently small.
0 references
random graphs
0 references
chromatic number
0 references
Bernoulli graph
0 references
