Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) (Q1095149): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q105583313, #quickstatements; #temporary_batch_1704713108017 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105583313 / rank | |||
Normal rank | |||
Revision as of 13:26, 8 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) |
scientific article |
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
