On the chromatic number of random regular graphs

Let G(n,d)G(n,d) be the random d-regular graph on n vertices. For every integer k   exceeding a certain constant k0k0 we identify a number dk-coldk-col such that G(n,d)G(n,d) is k  -colorable w.h.p. if ddk-cold>dk-col.