ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an nn-vertex graph GG, let XG,kX_{G,k} be the number of edges induced by a uniformly random kk-vertex subset of GG. Define

I(n,k,ℓ)=max⁡{Pr⁡(XG,k=ℓ):∣V(G)∣=n}I(n,k,\ell)=\max\{\Pr(X_{G,k}=\ell):|V(G)|=n\}

and

ind⁡(k,ℓ)=lim⁡n→∞I(n,k,ℓ).\operatorname{ind}(k,\ell)=\lim_{n\to\infty}I(n,k,\ell).

Alon–Hefetz–Krivelevich–Tyomkyn's superlinear sparsity conjecture. For all k,ℓk,\ell satisfying

min⁡\originalleft{ℓ,(k2)−ℓ\aftergroup\originalright}=ωk(k),\min\mathopen{}\mathclose\bgroup\originalleft\{\ell,\binom{k}{2}-\ell\aftergroup\egroup\originalright\}=\omega_k(k),

we have

ind⁡(k,ℓ)=ok(1).\operatorname{ind}(k,\ell)=o_k(1).

This predicts asymptotic anticoncentration whenever both the number of induced edges and the number of nonedges grow superlinearly in kk. Its status is not resolved in the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.