Author:
KANG ROSS J.,McDIARMID COLIN
Abstract
We consider the t-improper chromatic number of the Erdős–Rényi random graph Gn,p. The t-improper chromatic number χt(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 χt(Gn,p) over the range of choices for the growth of t = t(n).
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference22 articles.
1. Large Deviations Techniques and Applications
2. Defective coloring revisited
3. Defective list colorings of planar graphs;Eaton;Bull. Inst. Combin. Appl.,1999
4. Random Graphs
5. [9] Fountoulakis N. , Kang R. J. and McDiarmid C. (2008) The t-stability number of a random graph. Submitted; arxiv.0809.0141: [math.CO].
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献