The clique chromatic number of sparse random graphs
Abstract: The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of magnitude of the clique chromatic number of the random graph G_{n,p} for most edge-probabilities p in the range n{-2/5} \ll p \ll 1. This resolves open problems and questions of Lichev, Mitsche and Warnke as well as Alon and Krievelevich. One major proof difficulty stems from high-degree vertices, which prevent maximal cliques in their neighborhoods: we deal with these vertices by an intricate union bound argument, that combines the probabilistic method with new degree counting arguments in order to enable Janson's inequality. This way we determine the asymptotics of the clique chromatic number of G_{n,p} in some ranges, and discover a surprising new phenomenon that contradicts earlier predictions for edge-probabilities p close to n{-2/5}.
- D. Achlioptas and A. Naor. The two possible values of the chromatic number of a random graph. Annals of Mathematics 162 (2005), 1335–1351.
- N. Alon and M. Krivelevich. The concentration of the chromatic number of random graphs. Combinatorica 17 (1997), 303–313.
- N. Alon and M. Krivelevich. Clique coloring of dense random graphs. Journal of Graph Theory 88 (2018), 428–433.
- Coloring the maximal cliques of graphs. SIAM Journal on Discrete Mathematics 17 (2004), 361–376.
- T. Bohman. The triangle-free process. Advances in Mathematics 221 (2009), 1653–1677.
- T. Bohman and P. Keevash. The early evolution of the H𝐻Hitalic_H-free process. Inventiones Mathematicae 181 (2010), 291–336.
- B. Bollobás. The chromatic number of random graphs. Combinatorica 8 (1988), 49–55.
- Perfect graphs of arbitrarily large clique-chromatic number. Journal of Combinatorial Theory, Series B 116 (2016), 456–464.
- Y. Demidovich and M. Zhukovskii. Tight asymptotics of clique-chromatic numbers of dense random graphs. Journal of Graph Theory 103 (2023), 451–461.
- Two-colouring all two-element maximal antichains. Journal of Combinatorial Theory, Series A 57 (1991), 109–116.
- A note on the clique chromatic number of geometric graphs. Geombinatorics 28 (2018), 83–86.
- H. Guo and L. Warnke. Packing Nearly Optimal Ramsey R(3,t)𝑅3𝑡R(3,t)italic_R ( 3 , italic_t ) Graphs. Combinatorica 40 (2020), 63–103.
- A. Heckel. Non-concentration of the chromatic number of a random graph. Journal of the American Mathematical Society 34 (2021), 245–260.
- S. Janson. Poisson approximation for large deviations. Random Structures & Algorithms 1 (1990), 221–229.
- Random Graphs. Wiley-Interscience, New York (2000).
- S. Janson and L. Warnke. The lower tail: Poisson approximation revisited. Random Structures & Algorithms 48 (2016), 219–246.
- Tight bounds on the clique chromatic number. Electronic Journal of Combinatorics 28 (2021), Paper No. 3.51, 8pp.
- J.H. Kim. The Ramsey number R(3,t)𝑅3𝑡R(3,t)italic_R ( 3 , italic_t ) has order of magnitude t2/logtsuperscript𝑡2𝑡t^{2}/\log titalic_t start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT / roman_log italic_t. Random Structures & Algorithms 7 (1995), 173–207.
- J. Kratochvíl and Z. Tuza. On the complexity of bicoloring clique hypergraphs of graphs. Journal of Algorithms 45 (2002), 40–54.
- The jump of the clique chromatic number of random graphs. Random Structures & Algorithms 62 (2023), 1016–1034.
- D. Marx. Complexity of clique coloring and related problems. Theoretical Computer Science 412 (2011), 3487–3500.
- Clique colourings of geometric graphs. Electronic Journal of Combinatorics 25 (2018), Paper 4.56, 20pp.
- Clique coloring of binomial random graphs. Random Structures & Algorithms 54 (2019), 589–614.
- B. Mohar and R. Škrekovski. The Grötzsch theorem for the hypergraph of maximal cliques. Electronic Journal of Combinatorics 6 (2020), Paper 26, 13pp.
- O. Riordan and L. Warnke. The Janson inequalities for general up-sets. Random Structures & Algorithms 46 (2015), 391–395.
- E. Shamir and J. Spencer. Sharp concentration of the chromatic number on random graphs Gn,psubscript𝐺𝑛𝑝G_{n,p}italic_G start_POSTSUBSCRIPT italic_n , italic_p end_POSTSUBSCRIPT. Combinatorica 7 (1987), 121–129.
- Clique-transversal sets and clique-coloring in planar graphs. European Journal of Combinatorics 36 (2014), 367–376.
- M. Šileikis and L. Warnke. Upper tail bounds for stars. Electronic Journal of Combinatorics 27 (2020), Paper No. 1.67, 23pp.
- L. Warnke. When does the K4subscript𝐾4K_{4}italic_K start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT-free process stop? Random Structures & Algorithms 44 (2014), 355–397.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.