Anti-concentration conjecture for the independence number of sparse random graphs with a fixed number of edges
Anti-concentration conjecture for the independence number of sparse random graphs with a fixed number of edges
Let be the random graph with vertices and edges, and let denote its independence number. Suppose
where is a constant such that . Anti-concentration conjecture. Then is not concentrated on values. At the moment, no lower bound on the extent of concentration of is known in this regime; the conjecture concerns anti-concentration for .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Tom Bohman and Jakob Hofstad, “Two-Point Concentration of the Independence Number of the Random Graph”, arXiv:2208.00117 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.