Article

Randomly colouring graphs with girth five and large maximum degree

Authors:

Lap Chi Lau,

Michael MolloyAuthors Info & Claims

LATIN'06: Proceedings of the 7th Latin American conference on Theoretical Informatics

Pages 665 - 676

https://doi.org/10.1007/11682462_61

Published: 20 March 2006 Publication History

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 log³n mixes rapidly if k=qΔ and q>β where β=1.645... is the root of 2-(1-e^−1/β)²−2βe^−1/β = 0.

References

[1]

K. Azuma. Weighted sums of certain dependent random variables. Tokuku. Math. Journal, 19, pp. 357-367, 1967.

Google Scholar

[2]

R. Bubley and M. Dyer. Path coupling: a technique for proving rapid mixing in Markov chains. Proceedings of FOCS 1997, pp. 223-231.

Digital Library

Google Scholar

[3]

M. Dyer, A. Flaxman, A. Frieze and E. Vigoda. Randomly coloring sparse random graphs with fewer colors than the maximum degree. Manuscript, 2004.

Google Scholar

[4]

M. Dyer and A. Frieze. Randomly colouring graphs with lower bounds on girth and maximum degree. Random Structures and Algorithms, 23, pp. 167-179, 2003.

Crossref

Google Scholar

[5]

M. Dyer, A. Frieze, T. Hayes, E. Vigoda. Randomly coloring constant degree graphs. Proceedings of FOCS 2004, pp. 582-589.

Digital Library

Google Scholar

[6]

A. Frieze and J. Vera. On randomly colouring locally sparse graphs. Manuscript, 2004.

Google Scholar

[7]

T. Hayes. Randomly coloring graphs of girth at least five. Proceedings of STOC 2003, pp. 269-278.

Digital Library

Google Scholar

[8]

T. Hayes and E. Vigoda. A non-Markovian coupling for randomly sampling colorings. Proceedings of FOCS 2003, pp. 618-627.

Digital Library

Google Scholar

[9]

T. Hayes and E. Vigoda. Variable length path coupling. Proceedings of SODA 2004, pp. 103-110.

Digital Library

Google Scholar

[10]

T. Hayes and E. Vigoda. Coupling with the stationary distribution and improved sampling for colorings and independent sets. Proceedings of SODA 2005, pp. 971- 979.

Digital Library

Google Scholar

[11]

M. Jerrum. A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Random Structures and Algorithms, 7, pp. 157-165, 1995.

Crossref

Google Scholar

[12]

M. Molloy. The Glauber dynamics on colorings of a graph with high girth and maximum degree. SIAM Journal on Computing, 33, pp. 721-737, 2004.

Digital Library

Google Scholar

[13]

M. Molloy and B. Reed. Graph colourings and the probabilistic method. Springer, 2002.

Crossref

Google Scholar

[14]

J. Salas and A. Sokal. Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Statist. Phys., 86, pp. 551-579, 1997.

Crossref

Google Scholar

[15]

E. Vigoda. Improved bounds for sampling colorings. Journal of Mathematical Physics, 41, pp. 1555-1569, 2000.

Crossref

Google Scholar

Cited By

View all

Chen SDelcourt MMoitra APerarnau GPostle LChan T(2019)Improved bounds for randomly sampling colorings via linear programmingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310569(2216-2234)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310569
Efthymiou CHayes TŠtefankovič DVigoda ECzumaj A(2018)Sampling random colorings of sparse random graphsProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175420(1759-1771)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175420
Cannon SRandall D(2016)Sampling on lattices with free boundary conditions using randomized extensionsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884572(1952-1971)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884572

Recommendations

b-colouring outerplanar graphs with large girth

A b-colouring of a graph is a colouring of its vertices such that every colour class contains a vertex that has a neighbour in all other classes. The b-chromatic number of a graph is the largest integer k such that the graph has a b-colouring with k ...
Fractional Coloring of Planar Graphs of Girth Five

A graph $G$ is $(a:b)$-colorable if there exists an assignment of $b$-element subsets of $\{1,\ldots,a\}$ to vertices of $G$ such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph $G$ and a vertex ...
Linear coloring of planar graphs with large girth

A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic numberlc(G) of the graph G is the smallest number of colors in a linear coloring of ...

Comments

Information & Contributors

Information

Published In

LATIN'06: Proceedings of the 7th Latin American conference on Theoretical Informatics

March 2006

811 pages

ISBN:354032755X

Editors:
José R. Correa
School of Business, Universidad Adolfo Ibáñez, Chile
,
Alejandro Hevia
Dept. of Computer Science, University of Chile, Blanco Encalada 2120, 3er piso, Santiago, Chile
,
Marcos Kiwi
Dept. Ing. Matemática & Ctr. de Modelamiento Matemático, UMI 2807 U. Chile-CNRS, Blanco Encalada 2120, 3er piso, Santiago

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 March 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen SDelcourt MMoitra APerarnau GPostle LChan T(2019)Improved bounds for randomly sampling colorings via linear programmingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310569(2216-2234)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310569
Efthymiou CHayes TŠtefankovič DVigoda ECzumaj A(2018)Sampling random colorings of sparse random graphsProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175420(1759-1771)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175420
Cannon SRandall D(2016)Sampling on lattices with free boundary conditions using randomized extensionsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884572(1952-1971)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884572

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

b-colouring outerplanar graphs with large girth

Fractional Coloring of Planar Graphs of Girth Five

Linear coloring of planar graphs with large girth

Comments

Published In

Sponsors

Publisher

Publication History

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

References

Cited By

Recommendations

b-colouring outerplanar graphs with large girth

Fractional Coloring of Planar Graphs of Girth Five

Linear coloring of planar graphs with large girth

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations