Coloring random graphs

DOI10.1016/S0020-0190(98)00092-1zbMath1337.05099OpenAlexW2081285697MaRDI QIDQ293318

Michael Krivelevich, Benjamin Sudakov

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000921?np=y

zbMATH Keywords

analysis of algorithmsrandom graphs: graph coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items

Planting Colourings Silently ⋮ Local convergence of random graph colorings ⋮ Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms ⋮ Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs

Cites Work

• Expose-and-merge exploration and the chromatic number of a random graph
• Large Cliques Elude the Metropolis Process
• On colouring random graphs
• Cliques in random graphs
• The chromatic number of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item