Prefer a chat interface with context about you and your work?
On the chromatic number of random graphs
Abstract We consider random graphs G n,p with fixed edge‐probability p. We refine an argument of Bollobás to show that almost all such graphs have chromatic number equal to n /{2 log b n − 2 log b log b n + O (1)} where b = 1/(1 − p …