On the chromatic number of random regular graphs

被引:20
|
作者
Coja-Oghlan, Amin [1 ]
Efthymiou, Charilaos [2 ]
Hetterich, Samuel [1 ]
机构
[1] Goethe Univ Frankfurt, Math Inst, Frankfurt, Germany
[2] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
基金
欧洲研究理事会;
关键词
Random graphs; Graph coloring; Phase transitions; SHARP CONCENTRATION; INDEPENDENCE; THRESHOLD;
D O I
10.1016/j.jctb.2015.09.006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G(n, d) be the random d-regular graph on n vertices. For every integer k exceeding a certain constant k(0) we identify a number 4,01 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). (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:367 / 439
页数:73
相关论文
共 50 条