By Topic

Randomly colouring graphs with lower bounds on girth and maximum degree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Dyer ; Sch. of Comput., Leeds Univ., UK ; A. Frieze

We consider the problem of generating a random q-colouring of a graph G=(V, E). We consider the simple Glauber Dynamics chain. We show that if the maximum degree Δ>cl ln n and the girth g>c2 ln ln n (n=|V|), then this chain mixes rapidly provided C1, C2 are sufficiently large, q/A>β, where β≈1.763 is the root of β=e1β/. For this class of graphs, this beats the 11Δ/6 bound of E. Vigoda (1999) for general graphs. We extend the result to random graphs.

Published in:

Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on

Date of Conference:

8-11 Oct. 2001