The Chromatic Number of Random Regular Graphs

15 years 10 months ago

Download www.cs.unm.edu

Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1, or k + 2.

Dimitris Achlioptas, Cristopher Moore

Real-time Traffic

Algorithms | APPROX 2004 | Log K | Random D-regular Graph | Smallest Integer |

claim paper

» Colouring Random Regular Graphs

» Total and fractional total colourings of circulant graphs

» Colouring Random 4Regular Graphs

» The game chromatic number of random graphs

» Finding the chromatic number by means of critical graphs

» Martingales on Trees and the Empire Chromatic Number of Random Trees

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

» On the Chromatic Number of Random Graphs

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	APPROX
Authors	Dimitris Achlioptas, Cristopher Moore

Comments (0)

Sciweavers

The Chromatic Number of Random Regular Graphs

Algorithms | APPROX 2004 | Log K | Random D-regular Graph | Smallest Integer |

Explore & Download

Productivity Tools

Sciweavers