2000 character limit reached
The t-improper chromatic number of random graphs (0809.4726v2)
Published 26 Sep 2008 in math.CO and math.PR
Abstract: We consider the $t$-improper chromatic number of the Erd{\H o}s-R{\'e}nyi random graph $G(n,p)$. The t-improper chromatic number $\chit(G)$ of $G$ is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most $t$. If $t = 0$, then this is the usual notion of proper colouring. When the edge probability $p$ is constant, we provide a detailed description of the asymptotic behaviour of $\chit(G(n,p))$ over the range of choices for the growth of $t = t(n)$.