A note on the sharp concentration of the chromatic number of random graphs (Q1180430)
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: A note on the sharp concentration of the chromatic number of random graphs |
scientific article; zbMATH DE number 25779
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the sharp concentration of the chromatic number of random graphs |
scientific article; zbMATH DE number 25779 |
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
0.9772881
0 references
0.9620808
0 references
0.9496598
0 references
0.94756246
0 references
0.94614947
0 references
0.9344578
0 references
0.9330042
0 references
0.93282217
0 references
0.92716914
0 references
