ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be sufficiently large, let GG be 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.

Lee's conjecture. For every tree TT,

P(T≅T)≤n−Ω(1).\mathbb{P}(\mathcal{T} \cong T) \le n^{-\Omega(1)}.

This conjecture seeks a polynomial anticoncentration bound in graphs of large minimum degree, generalizing the exponential anticoncentration known for almost regular graphs. The complete bipartite graph Kd,n−dK_{d,n-d} shows that an exponential bound in nn is impossible in this setting.

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.