Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
From MaRDI portal
Publication:1095149
DOI10.1007/BF02579208zbMath0632.05024WikidataQ105583313 ScholiaQ105583313MaRDI QIDQ1095149
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, Generalized chromatic numbers of random graphs, On Brooks' Theorem for Sparse Graphs, The chromatic number of random graphs, Spectra, Euclidean representations and clusterings of hypergraphs, Holes in random graphs, A note on the sharp concentration of the chromatic number of random graphs, On the independence and chromatic numbers of random regular graphs, Acyclic orientations of random graphs, On the minimal number of edges in color-critical graphs, The concentration of the chromatic number of random graphs, Concentration of measure and isoperimetric inequalities in product spaces