The game chromatic number of dense random graphs (Q490261): Difference between revisions

Summary: Suppose that two players take turns coloring the vertices of a given graph \(G\) with \(k\) colors. In each move the current player colors a vertex such that neighboring vertices get different colors. The first player wins this game if and only if at the end, all vertices are colored. The game chromatic number \(\chi_{g}(G)\) is defined as the smallest \(k\) for which the first player has a winning strategy. Recently, \textit{T. Bohman} et al. [Random Struct. Algorithms 32, No. 2, 223--235 (2008; Zbl 1139.05017)] analysed the game chromatic number of random graphs and obtained lower and upper bounds of the same order of magnitude. In this paper we improve existing results and show that with high probability, the game chromatic number \(\chi_{g}(G_{n,p})\) of dense random graphs with \(p \geqslant e^{-o(\log n)}\) is asymptotically twice as large as the ordinary chromatic number \(\chi(G_{n,p})\).