The sharp anticoncentration conjecture for random spanning trees
Statement
Let be sufficiently large, and let be sufficiently large relative to . Suppose that is a connected graph with vertices and minimum degree at least , and let be a uniformly random spanning tree of .
Sharp anticoncentration conjecture. For every tree ,
The conjecture proposes the optimal constant factor in the exponent and matches the anticoncentration scale suggested by the complete bipartite graph . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.