ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be sufficiently large, and let nn be sufficiently large relative to dd. Suppose that GG is a connected graph with nn vertices and minimum degree at least dd, and let T\mathcal{T} be a uniformly random spanning tree of GG.

Sharp anticoncentration conjecture. For every tree TT,

P(T≅T)≤n−(1/2−on(1))(d−1).\mathbb{P}(\mathcal{T} \cong T) \le n^{-(1/2-o_n(1))(d-1)}.

The conjecture proposes the optimal constant factor in the exponent and matches the anticoncentration scale suggested by the complete bipartite graph Kd,n−dK_{d,n-d}. The paper proves a weaker anticoncentration bound, so this sharper estimate 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.