论文信息 - On the Chromatic Number of Random Graphs - 字舞流文

On the Chromatic Number of Random Graphs

We consider random graphs Gn,p with fixed edge-probability p. We refine an argument of Bollobas to show that almost all such graphs have chromatic number equal to n/{2 logbn − 2 logb logbn + O(1)} where b = 1/(1 − p).

Colin McDiarmid | C. McDiarmid

[1] Béla Bollobás,et al. The chromatic number of random graphs , 1988, Comb..

[2] D. W. MATULA. Expose-and-merge exploration and the chromatic number of a random graph , 1987, Comb..

[3] Colin McDiarmid,et al. Topics in Chromatic Graph Theory: Colouring random graphs , 2015 .

[4] Tomasz Luczak. The chromatic number of random graphs , 1991, Comb..

[5] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[6] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[7] Joel H. Spencer,et al. Sharp concentration of the chromatic number on random graphsGn, p , 1987, Comb..

[8] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[9] Tomasz Luczak,et al. The chromatic number of random graphs at the double-jump threshold , 1989, Comb..