Colouring Random 4-Regular Graphs

11 years 11 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular graph. The analysis includes use of the differential equation method, and exponential bounds on the tail of random variables associated with branching processes. A substantial part of the analysis applies to random d-regular graphs in general.
Lingsheng Shi, Nicholas C. Wormald
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CPC
Authors Lingsheng Shi, Nicholas C. Wormald
Comments (0)