On the non-3-colourability of random graphs

Details On the non-3-colourability of random graphs On the non-3-colourability of random graphs

2002-09-09

arxiv.org/abs/math/0209087v1

Mathematics

Combinatorics

9 pages, 1 figure

Scientific paper

We show that for c >= 2.4682, a random graph on n vertices with c n (1+o(1))
edges almost surely has no 3-colouring. This improves on the current best upper
bound of 2.4947.

Affiliated with

Also associated with

No associations

Rating

On the non-3-colourability of random graphs 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 On the non-3-colourability of random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the non-3-colourability of random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-500486