The game chromatic number of random graphs

Details The game chromatic number of random graphs The game chromatic number of random graphs

2007-07-03

arxiv.org/abs/0707.0465v1

Mathematics

Combinatorics

Scientific paper

Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are colored. The game chromatic number \chi_g(G) is the minimum k for which the first player has a winning strategy. In this paper we analyze the asymptotic behavior of this parameter for a random graph G_{n,p}. We show that with high probability the game chromatic number of G_{n,p} is at least twice its chromatic number but, up to a multiplicative constant, has the same order of magnitude. We also study the game chromatic number of random bipartite graphs.

Affiliated with

Also associated with

No associations

Rating

The game chromatic number of random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The game chromatic number of random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The game chromatic number of random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180020