The chromatic number of dense random graphs
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a vertex colouring where no two adjacent vertices are coloured the same. The chromatic number of the dense random graph G ∼ G(n, p) where p ∈ (0, 1) is constant has been intensively studied since the 1970...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
Wiley
2018
|