ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

I(n,k,ℓ):=max⁡{P[XG,k=ℓ]:v(G)=n},I(n,k,\ell):=\max\{\mathbb{P}[X_{G,k}=\ell]:v(G)=n\},

with

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

Quadratic-range edge-statistics conjecture. For all k,ℓ∈Nk,\ell\in\mathbb{N} with

min⁡{ℓ,(k2)−ℓ}=Ωk(k2),\min\left\{\ell,\binom{k}{2}-\ell\right\}=\Omega_k(k^2),

we have

ind⁡(k,ℓ)=Ok(k−1/2).\operatorname{ind}(k,\ell)=O_k(k^{-1/2}).

This is a quantitative strengthening in the dense interior range of the edge-count parameter, predicting a polynomial decay of the maximum asymptotic fraction of kk-vertex subsets inducing exactly ℓ\ell edges. The supplied text does not state whether this conjecture has been resolved.

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.