On-line List Colouring of Random Graphs

The on-line list colouring of binomial random graphs \(\mathcal{G}(n,p)\) is studied. We show that the on-line choice number of \(\mathcal{G}(n,p)\) is asymptotically almost surely asymptotic to the chromatic number of \(\mathcal{G}(n,p)\), provided that the average degree d = p(n − 1) tends to infinity faster than (loglogn)1∕3(logn)2n2∕3. For sparser graphs, we are slightly less successful; we show that if d ≥ (logn)2+ɛ for some ɛ > 0, then the on-line choice number is larger than the chromatic number by at most a multiplicative factor of C, where C ∈ [2, 4], depending on the range of d. Also, for d = O(1), the on-line choice number is, by at most, a multiplicative constant factor larger than the chromatic number.

[1]  Noga Alon,et al.  List Coloring of Random and Pseudo-Random Graphs , 1999, Comb..

[2]  Uwe Schauz,et al.  Mr. Paint and Mrs. Correct , 2009, Electron. J. Comb..

[3]  V. Vu,et al.  Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time , 2000, J. Comb. Optim..

[4]  Benny Sudakov,et al.  On the probability of independent sets in random graphs , 2003, Random Struct. Algorithms.

[5]  Tomasz Luczak.  The chromatic number of random graphs , 1991, Comb..

[6]  Noga Alon,et al.  Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.

[7]  Amin Coja-Oghlan,et al.  Exact and approximative algorithms for coloring G(n,p) , 2004 .

[8]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Michael Krivelevich,et al.  Choosability in Random Hypergraphs , 2001, J. Comb. Theory, Ser. B.

[10]  Michael Krivelevich.  The Choice Number Of Dense Random Graphs , 2000, Comb. Probab. Comput..

[11]  James B. Shearer,et al.  A note on the independence number of triangle-free graphs , 1983, Discret. Math..

[12]  N. Alon.  Restricted colorings of graphs , 1993 .

[13]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[14]  Amin Coja-Oghlan,et al.  Exact and approximative algorithms for coloring G(n,p) , 2004, Random Struct. Algorithms.

[15]  Béla Bollobás,et al.  Random Graphs , 1985 .

[16]  Xuding Zhu,et al.  On-Line List Colouring of Graphs , 2009, Electron. J. Comb..