Clique colouring of binomial random graphs

Author: 

McDiarmid, C
Mitsche, D
Pralat, P

Publication Date: 

12 November 2018

Journal: 

Random Structures and Algorithms

Last Updated: 

2019-11-14T00:31:26.463+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.

Symplectic id: 

660234

Download URL: 

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article