Anti-concentration conjecture for the independence number of sparse random graphs with a fixed number of edges

From papers

Let Gn,mG_{n,m} be the random graph with nn vertices and mm edges, and let falpha(Gn,m)falpha(G_{n,m}) denote its independence number. Suppose

m=nηm=n^{\eta}

where falphafalpha is a constant such that 1<falpha<4/31<falpha<4/3. Anti-concentration conjecture. Then falpha(Gn,m)falpha(G_{n,m}) is not concentrated on n23falpha/2ϵn^{2-3falpha/2-\epsilon} values. At the moment, no lower bound on the extent of concentration of falpha(Gn,m)falpha(G_{n,m}) is known in this regime; the conjecture concerns anti-concentration for mn4/3m\leq n^{4/3}.

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

No solutions have been posted yet.