Clique coloring of binomial random graphs

DOI10.1002/rsa.20804zbMath1417.05075arXiv1611.01782OpenAlexW2963259603MaRDI QIDQ5229333

Dieter Mitsche, Paweł Prałat, Colin J. H. McDiarmid

Publication date: 14 August 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.01782

zbMATH Keywords

random graphsclique chromatic number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Tight bounds on the clique chromatic number ⋮ Tight asymptotics of clique‐chromatic numbers of dense random graphs ⋮ The jump of the clique chromatic number of random graphs ⋮ On the concentration of the chromatic number of random graphs ⋮ Random perfect graphs ⋮ Clique colourings of geometric graphs

This page was built for publication: Clique coloring of binomial random graphs