A note on the chromatic number of a dense random graph
From MaRDI portal
Publication:1025972
DOI10.1016/J.DISC.2008.09.019zbMATH Open1181.05078OpenAlexW1978161421MaRDI QIDQ1025972FDOQ1025972
Authors: Angelika Steger, Konstantinos 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths in graphs
- The two possible values of the chromatic number of a random graph
- Expose-and-merge exploration and the chromatic number of a random graph
- On colouring random graphs
- Cliques in random graphs
- The chromatic number of random graphs
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- The concentration of the chromatic number of random graphs
- The chromatic number of random graphs
- How Sharp is the Concentration of the Chromatic Number?
- On the Chromatic Number of Random Graphs
Cited In (19)
- How does the chromatic number of a random graph vary?
- Almost all graphs with high girth and suitable density have high chromatic number
- The chromatic number of dense random graphs
- For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set
- A note on the sharp concentration of the chromatic number of random graphs
- Tight asymptotics of clique‐chromatic numbers of dense random graphs
- How Sharp is the Concentration of the Chromatic Number?
- Complexity of coloring random graphs: an experimental study of the hardest region
- The chromatic number of random graphs
- On two limit values of the chromatic number of a random hypergraph
- The Choice Number of Dense Random Graphs
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
- Clique coloring of dense random graphs
- On the chromatic number in the stochastic block model
- Sharp concentration of the equitable chromatic number of dense random graphs
- Chromatic thresholds in dense random graphs
- Cliques and chromatic number in multiregime random graphs
- Non-concentration of the chromatic number of a random graph
- The average size of an independent set in graphs with a given chromatic number
This page was built for publication: A note on the chromatic number of a dense random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025972)