Journal title
Random Structures and Algorithms
Last updated
2022-01-19T04:49:09.543+00:00
Abstract
A clique colouring of a graph is a colouring of the vertices so that no
maximal clique is monochromatic (ignoring isolated vertices). The smallest
number of colours in such a colouring is the clique chromatic number.
In this paper, we study the asymptotic behaviour of the clique chromatic
number of the random graph G(n,p) for a wide range of edge-probabilities
p=p(n). We see that the typical clique chromatic number, as a function of the
average degree, forms an intriguing step function.
maximal clique is monochromatic (ignoring isolated vertices). The smallest
number of colours in such a colouring is the clique chromatic number.
In this paper, we study the asymptotic behaviour of the clique chromatic
number of the random graph G(n,p) for a wide range of edge-probabilities
p=p(n). We see that the typical clique chromatic number, as a function of the
average degree, forms an intriguing step function.
Symplectic ID
660234
Download URL
http://arxiv.org/abs/1611.01782v1
Submitted to ORA
On
Publication type
Journal Article
Publication date
12 November 2018