Non-concentration of the chromatic number of a random graph

DOI10.1090/jams/957zbMath1457.05036arXiv1906.11808OpenAlexW3015882930MaRDI QIDQ5147326

Annika Heckel

Publication date: 3 February 2021

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

binomial random graphdense random graphs

Mathematics Subject Classification ID

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

Related Items (5)

Two-Point Concentration of the Independence Number of the Random Graph ⋮ How does the chromatic number of a random graph vary? ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ On the concentration of the chromatic number of random graphs ⋮ Isomorphisms between random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of Stein's method
• On the chromatic number of random graphs
• The \(t\)-stability number of a random graph
• A note on the chromatic number of a dense random graph
• 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
• The concentration of the chromatic number of random graphs
• On colouring random graphs
• Cliques in random graphs
• The chromatic number of dense random graphs
• On the Concentration of the Domination Number of the Random Graph
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph

This page was built for publication: Non-concentration of the chromatic number of a random graph