Four-regime variance conjecture for the chromatic number of random graphs

About 5 years old · traced to

Let a(n)a(n) and x(n)x(n) be defined by a(n)=⌊α0(n)−1/2⌋a(n)=\lfloor\alpha_0(n)-1/2\rfloor and

μa(n)=2xna2=Θ(xnlog⁡2n).\mu_{a}(n)=\frac{2x n}{a^2}=\Theta\left(\frac{x n}{\log^2 n}\right).

For good nn, let g(n)g(n) be the fluctuation scale in the asymptotic normality conjecture, equivalently g(n)=Var⁡(Yn)g(n)=\sqrt{\operatorname{Var}(Y_n)}, and set c0=2/log⁡2c_0=2/\log 2.

Four-regime variance conjecture. The following asymptotic estimates hold: (i) if x→0x\to0, then

g(n)∼μalog⁡log⁡n+log⁡(1/x)c0log⁡2n;g(n)\sim\sqrt{\mu_a}\frac{\log\log n+\log(1/x)}{c_0\log^2 n};

(ii) if x=Θ(1)x=\Theta(1), then

g(n)=Θ(μalog⁡log⁡nlog⁡2n)=Θ(wn);g(n)=\Theta\left(\sqrt{\mu_a}\frac{\log\log n}{\log^2 n}\right)=\Theta(w_n);

(iii) if x→∞x\to\infty with x=no(1)x=n^{o(1)}, then

g(n)∼μaxlog⁡log⁡n+log⁡xc0log⁡2n∼c1n1/2log⁡log⁡n+log⁡xxlog⁡3n;g(n)\sim\frac{\sqrt{\mu_a}}{x}\frac{\log\log n+\log x}{c_0\log^2 n}\sim c_1 n^{1/2}\frac{\log\log n+\log x}{\sqrt{x}\log^3 n};

and (iv) if x⩾(log⁡n)Cx\geqslant(\log n)^C for some constant C>0C>0, then

g(n)=Θ(μalog⁡xxlog⁡2n)=Θ(nlog⁡xxlog⁡3n).g(n)=\Theta\left(\frac{\sqrt{\mu_a}\log x}{x\log^2 n}\right)=\Theta\left(\frac{\sqrt n\log x}{\sqrt{x}\log^3 n}\right).

These regimes refine the proposed width of the chromatic-number distribution. They cover all good nn, with overlap between the third and fourth regimes; the transition constants are not determined in the middle regime, and the conjecture is open.

References

Primary source

Annika Heckel and Oliver Riordan, “How does the chromatic number of a random graph vary?”, arXiv:2103.14014 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.