Recognition: unknown
On the chromatic number of random regular graphs
classification
🧮 math.CO
math.PR
keywords
k-colnumberrandomcertainchromaticconstantd-regularexceeding
read the original abstract
Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.