The chromatic number of dense random graphs
From MaRDI portal
Publication:4684329
DOI10.1002/rsa.20757zbMath1401.05115arXiv1603.04836OpenAlexW2963535564MaRDI QIDQ4684329
Publication date: 28 September 2018
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04836
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Related Items (10)
On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ On the chromatic number in the stochastic block model ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ How does the chromatic number of a random graph vary? ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ Non-concentration of the chromatic number of a random graph ⋮ On the weak chromatic number of random hypergraphs ⋮ Sharp concentration of the equitable chromatic number of dense random graphs ⋮ Hitting times for Shamir’s problem
This page was built for publication: The chromatic number of dense random graphs
