Two-Point Concentration of the Independence Number of the Random Graph

DOI10.1017/fms.2024.6arXiv2208.00117MaRDI QIDQ6118770

Tom Bohman, Jakob Hofstad

Publication date: 28 February 2024

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberbinomial random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the independence number of random graphs
• On the chromatic number of random graphs
• 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
• Introduction to Random Graphs
• Independent Sets in Random Graphs from the Weighted Second Moment Method
• On independent sets in random graphs
• Cliques in random graphs
• Non-concentration of the chromatic number of a random graph
• On the Concentration of the Domination Number of the Random Graph
• The two possible values of the chromatic number of a random graph

This page was built for publication: Two-Point Concentration of the Independence Number of the Random Graph