The Freezing Threshold for k -Colourings of a Random Graph

DOI10.1145/3034781zbMath1426.05150OpenAlexW2786920798MaRDI QIDQ4561493

No author found.

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3034781

zbMATH Keywords

random graph\(k\)-colourings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ On the connectivity of proper colorings of random graphs and hypergraphs ⋮ Rigid Colorings of Hypergraphs and Contiguity

This page was built for publication: The Freezing Threshold for k -Colourings of a Random Graph