A note on the chromatic number of a dense random graph

DOI10.1016/j.disc.2008.09.019zbMath1181.05078OpenAlexW1978161421MaRDI QIDQ1025972

Angelika Steger, Konstantinos D. Panagiotou

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.019

zbMATH Keywords

random graphschromatic number

Mathematics Subject Classification ID

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

Related Items (8)

For most graphs H , most H -free graphs have a linear homogeneous set ⋮ Complexity of Coloring Random Graphs ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ On the chromatic number in the stochastic block model ⋮ How does the chromatic number of a random graph vary? ⋮ Non-concentration of the chromatic number of a random graph ⋮ Sharp concentration of the equitable chromatic number of dense random graphs ⋮ Cliques and chromatic number in multiregime random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Expose-and-merge exploration and the chromatic number of a random graph
• The concentration of the chromatic number of random graphs
• On colouring random graphs
• Cliques in random graphs
• Paths in graphs
• How Sharp is the Concentration of the Chromatic Number?
• On the Chromatic Number of Random Graphs
• The chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph

This page was built for publication: A note on the chromatic number of a dense random graph