The two possible values of the chromatic number of a random graph

Details The two possible values of the chromatic number of a random graph The two possible values of the chromatic number of a random graph

2007-06-12

arxiv.org/abs/0706.1725v1

Ann. of Math. (2) 162 (2005), no. 3, 1335--1351

Mathematics

Probability

17 pages, published version

Scientific paper

Given d \in (0,infty) let k_d 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 k_d
or k_d+1 almost surely.

Affiliated with

Also associated with

No associations

Rating

The two possible values of the chromatic number of a random graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The two possible values of the chromatic number of a random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The two possible values of the chromatic number of a random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359848