Title of article
The two possible values of the chromatic number of a random graph
Author/Authors
Naor، Assaf نويسنده , , Achlioptas، Dimitris نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
-1334
From page
1335
To page
0
Abstract
Given d in (0,(infinity)) let kd be the smallest integer k such that d<2k log k. We prove that the chromatic number of a random graph G(n,d/n) is either kd or kd+1 almost surely.
Keywords
Construction of the Q-system , V-cells , Decomposition stars , Local optimality , The top-level structure of the proof
Journal title
Annals of Mathematics
Serial Year
2005
Journal title
Annals of Mathematics
Record number
117829
Link To Document