Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) (Q1095149)
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: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) |
scientific article; zbMATH DE number 4027495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) |
scientific article; zbMATH DE number 4027495 |
Statements
Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) (English)
0 references
1987
0 references
Consider the length of an interval containing the chromatic number of a standard random graph \(G_{n,p}\) as \(n\to \infty\). Martingale theory is used to prove asymptotic results for a fixed p and for \(p=n^{-\alpha}\) with \(0<\alpha <1\).
0 references
martingale process
0 references
chromatic number
0 references
random graph
0 references
0.9772881
0 references
0.9532222
0 references
0.9460106
0 references
0.9455863
0 references
0.92705226
0 references
0.9267791
0 references
0.9241559
0 references
0.9180872
0 references
0.9180871
0 references
