Uniformly Random Colourings of Sparse Graphs
Pages 1357 - 1370
Abstract
We analyse uniformly random proper k-colourings of sparse graphs with maximum degree Δ in the regime Δ < klnk . This regime corresponds to the lower side of the shattering threshold for random graph colouring, a paradigmatic example of the shattering threshold for random Constraint Satisfaction Problems. We prove a variety of results about the solution space geometry of colourings of fixed graphs, generalising work of Achlioptas and Coja-Oghlan, and Molloy on random graphs, and justifying the performance of stochastic local search algorithms in this regime. Our central proof relies only on elementary techniques, namely the first-moment method and a quantitative induction, yet it strengthens list-colouring results due to Vu, and more recently Davies, Kang, P., and Sereni, and generalises state-of-the-art bounds from Ramsey theory in the context of sparse graphs. It further yields an approximately tight lower bound on the number of colourings, also known as the partition function of the Potts model, with implications for efficient approximate counting.
References
[1]
Dimitris Achlioptas and Amin Coja-Oghlan. 2008. Algorithmic barriers from phase transitions. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 793-802.
[2]
Dimitris Achlioptas, Fotis Iliopoulos, and Alistair Sinclair. 2019. Beyond the Lovász local lemma: Point to set correlations and their algorithmic applications. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 725-744.
[3]
Dimitris Achlioptas and Michael Molloy. 1997. The analysis of a list-coloring algorithm on a random graph. In Proceedings 38th Annual Symposium on Foundations of Computer Science. IEEE, 204-212.
[4]
Dimitris Achlioptas and Cristopher Moore. 2002. Almost all graphs with average degree 4 are 3-colorable. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. 199-208.
[5]
Dimitris Achlioptas and Federico Ricci-Tersenghi. 2006. On the solution-space geometry of random constraint satisfaction problems. In Proceedings of the thirtyeighth annual ACM symposium on Theory of computing. 130-139.
[6]
Noga Alon, Michael Krivelevich, and Benny Sudakov. 1999. Coloring graphs with sparse neighborhoods. Journal of Combinatorial Theory, Series B 77, 1 ( 1999 ), 73-82.
[7]
Noga Alon and Joel H Spencer. 2016. The probabilistic method. John Wiley & Sons.
[8]
James Anderson, Anton Bernshteyn, and Abhishek Dhawan. 2021. Coloring graphs with forbidden bipartite subgraphs. arXiv preprint arXiv:2107.05595 ( 2021 ).
[9]
Anton Bernshteyn. 2019. The Johansson-Molloy theorem for DP-coloring. Random Structures & Algorithms 54, 4 ( 2019 ), 653-664.
[10]
Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, and Akum Kang. 2021. Counting colorings of triangle-free graphs. arXiv preprint arXiv:2109.13376 ( 2021 ).
[11]
Marthe Bonamy, Nicolas Bousquet, and Guillem Perarnau. 2021. Frozen (Δ+ 1)-colourings of bounded degree graphs. Combinatorics, Probability and Computing 30, 3 ( 2021 ), 330-343.
[12]
Marthe Bonamy, Tom Kelly, Peter Nelson, and Luke Postle. 2018. Bounding by a fraction of Δ for graphs without large cliques. arXiv preprint arXiv: 1803. 01051 ( 2018 ).
[13]
Péter Csikvári. 2016. Extremal regular graphs: the case of the infinite regular tree. arXiv preprint arXiv:1612.01295 ( 2016 ).
[14]
Péter Csikvári and Zhicong Lin. 2016. Sidorenko's conjecture, colorings and independent sets. arXiv preprint arXiv:1603.05888 ( 2016 ).
[15]
Ewan Davies, Rémi de Joannis de Verclos, Ross J Kang, and François Pirot. 2020. Coloring triangle-free graphs with local list sizes. Random Structures & Algorithms 57, 3 ( 2020 ), 730-744.
[16]
Ewan Davies, Ross J Kang, François Pirot, and Jean-Sébastien Sereni. 2020. Graph structure via local occupancy. arXiv preprint arXiv: 2003. 14361 ( 2020 ).
[17]
Zdeněk Dvořák and Luke Postle. 2018. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. Journal of Combinatorial Theory, Series B 129 ( 2018 ), 38-54.
[18]
Martin E Dyer and Alan M Frieze. 1986. Fast solution of some random NP-hard problems. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986 ). IEEE Computer Society, 331-336.
[19]
David Gamarnik. 2021. The overlap gap property: A topological barrier to optimizing over random structures. Proceedings of the National Academy of Sciences 118, 41 ( 2021 ), e2108492118.
[20]
Fotios Iliopoulos. 2019. Stochastic Local Search and the Lovasz Local Lemma. University of California, Berkeley.
[21]
Anders Johansson. 1996. The choice number of sparse graphs. Preliminary version, April ( 1996 ).
[22]
Florent Krzakała, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, and Lenka Zdeborová. 2007. Gibbs states and the set of solutions of random constraint satisfaction problems. Proceedings of the National Academy of Sciences 104, 25 ( 2007 ), 10318-10323.
[23]
Luděk Kučera. 1989. Graphs with small chromatic numbers are easy to color. Information processing letters 30, 5 ( 1989 ), 233-236.
[24]
Brendan D McKay, Nicholas C Wormald, and Beata Wysocka. 2004. Short cycles in random regular graphs. the electronic journal of combinatorics ( 2004 ), R66-R66.
[25]
Michael Molloy. 2012. The freezing threshold for k-colourings of a random graph. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing. 921-930.
[26]
Michael Molloy. 2019. The list chromatic number of graphs with small clique number. Journal of Combinatorial Theory, Series B 134 ( 2019 ), 264-284.
[27]
Robin A Moser and Gábor Tardos. 2010. A constructive proof of the general Lovász local lemma. Journal of the ACM (JACM) 57, 2 ( 2010 ), 1-15.
[28]
Alessandro Panconesi and Aravind Srinivasan. 1997. Randomized distributed edge coloring via an extension of the Chernof-Hoefding bounds. SIAM J. Comput. 26, 2 ( 1997 ), 350-368.
[29]
François Pirot and Jean-Sébastien Sereni. 2021. Fractional Chromatic Number, Maximum Degree, and Girth. SIAM Journal on Discrete Mathematics 35, 4 ( 2021 ), 2815-2843.
[30]
Matthieu Rosenfeld. 2020. Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree. The Electronic Journal of Combinatorics ( 2020 ), P3-43.
[31]
Jonathan S Turner. 1988. Almost all k-colorable graphs are easy to color. Journal of algorithms 9, 1 ( 1988 ), 63-82.
[32]
Van H Vu. 2002. A general upper bound on the list chromatic number of locally sparse graphs. Combinatorics, Probability and Computing 11, 1 ( 2002 ), 103-111.
[33]
Ian M Wanless and David R Wood. 2020. A general framework for hypergraph colouring. arXiv preprint arXiv: 2008. 00775 ( 2020 ).
[34]
David R Wood. 2020. Nonrepetitive graph colouring. arXiv preprint arXiv: 2009. 02001 ( 2020 ).
[35]
Lenka Zdeborová. 2008. Statistical physics of hard optimization problems. arXiv preprint arXiv:0806.4112 ( 2008 ).
[36]
Lenka Zdeborová and Florent Krzakaa. 2007. Phase transitions in the coloring of random graphs. Physical Review E 76, 3 ( 2007 ), 031131.
Index Terms
- Uniformly Random Colourings of Sparse Graphs
Recommendations
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
A k -colouring of a graph G =( V , E ) is a mapping c : V {1,2, , k } such that c ( u ) c ( v ) whenever uv is an edge. The reconfiguration graph of the k -colourings of G contains as its vertex set the k -colourings of G , and two ...
Dominated Colorings of Graphs
In this paper, we introduce and study a new coloring problem of a graph called the dominated coloring. A dominated coloring of a graph $$G$$ G is a proper vertex coloring of $$G$$ G such that each color class is dominated by at least one vertex of $$G$$ G . The minimum ...
Reconfiguring 10-Colourings of Planar Graphs
AbstractLet be an integer. The reconfiguration graph of the k-colourings of a graph G has as vertex set the set of all possible k-colourings of G and two colourings are adjacent if they differ on exactly one vertex. A conjecture of Cereceda from ...
Comments
Information & Contributors
Information
Published In
June 2023
1926 pages
Copyright © 2023 Owner/Author.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
STOC '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Upcoming Conference
STOC '25
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 260Total Downloads
- Downloads (Last 12 months)150
- Downloads (Last 6 weeks)25
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in