Lee's polynomial anticoncentration conjecture for random spanning trees
Statement
Let be sufficiently large, let be a connected graph with vertices and minimum degree at least , and let be a uniformly random spanning tree of .
Lee's conjecture. For every tree ,
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 shows that an exponential bound in 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.