The Chromatic Number of Random Graphs for Most Average Degrees
From MaRDI portal
Publication:4560521
DOI10.1093/imrn/rnv333zbMath1404.05189OpenAlexW2173716583MaRDI QIDQ4560521
Dan Vilenchik, Amin Coja-Oghlan
Publication date: 12 December 2018
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imrn/rnv333
Related Items (12)
Phase transitions in discrete structures ⋮ On the strong chromatic number of random hypergraphs ⋮ On the concentration of the chromatic number of a random hypergraph ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ Lower bounds on the chromatic number of random graphs ⋮ On the concentration of values of \(j\)-chromatic numbers of random hypergraphs ⋮ On the structure of the set of panchromatic colorings of a random hypergraph ⋮ Estimating the strong \(r\)-colorability threshold in random hypergraphs ⋮ On the strong chromatic number of a random 3-uniform hypergraph ⋮ On the chromatic numbers of random hypergraphs ⋮ On the Potts antiferromagnet on random graphs
This page was built for publication: The Chromatic Number of Random Graphs for Most Average Degrees