On the concentration of the chromatic number of random graphs

DOI10.37236/11638arXiv2201.00906OpenAlexW4392035608MaRDI QIDQ6194237

Lutz Warnke, Unnamed Author

Publication date: 19 March 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.00906

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When are small subgraphs of a random graph normally distributed?
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• A note on the sharp concentration of the chromatic number of random graphs
• Matching and covering the vertices of a random graph by copies of a given graph
• On the minimal number of edges in color-critical graphs
• The concentration of the chromatic number of random graphs
• Concentration for self-bounding functions and an inequality of Talagrand
• Factors in random graphs
• Poisson approximation for large deviations
• On colouring random graphs
• How Sharp is the Concentration of the Chromatic Number?
• The Janson inequalities for general up‐sets
• Non-concentration of the chromatic number of a random graph
• Clique coloring of binomial random graphs
• On the Method of Typical Bounded Differences
• The chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph
• The jump of the clique chromatic number of random graphs
• Prague dimension of random graphs
• On the chromatic number in the stochastic block model

This page was built for publication: On the concentration of the chromatic number of random graphs