ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph. For 0≤k≤n0\leq k\leq n, choose a uniformly random kk-vertex subset A⊆V(G)A\subseteq V(G) and let XG,k:=e(G[A])X_{G,k}:=e(G[A]) be the number of edges induced by AA. Suppose k→∞k\to\infty and nn grows sufficiently rapidly in terms of kk. For every integer ℓ\ell with

0<ℓ<(k2),0<\ell<\binom{k}{2},

Alon–Hefetz–Krivelevich–Tyomkyn's conjecture. One has

Pr⁡(XG,k=ℓ)≤1/e+o(1).\Pr(X_{G,k}=\ell)\leq 1/e+o(1).

This conjecture seeks a Poisson-type universal upper bound, analogous to the maximum point mass of a Poisson random variable with mean one. The source gives no resolution, so the conjecture remains open.

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.