Skip to main content
Conference Proceedings

Randomly colouring graphs with girth five and large maximum degree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3887 LNCS 665-676
DOI: 10.1007/11682462_61
6Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that the Glauber dynamics on the k-colourings of a graph G on n vertices with girth 5 and maximum degree Δ ≥ 1000 log3 n mixes rapidly if k = qΔ and q > β where β = 1.645... is the root of 2 - (1-e-1/β)2-2βe -1/β=0. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Lau, L. C., & Molloy, M. (2006). Randomly colouring graphs with girth five and large maximum degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3887 LNCS, pp. 665–676). https://doi.org/10.1007/11682462_61

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free