Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) (Q1095149): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Cliques in random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065548 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On colouring random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4076577 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Global versus local asymptotic theories of finite-dimensional normed spaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces / rank | |||
Normal rank | |||
Latest revision as of 13:28, 18 June 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
