ProbXiv
Explorersign in
Problem archiveProblem record

Statement

There is also a 1poly(n)\frac{1}{\text{poly}(n)} lower bound for the probability that a uniformly random spanning tree of an nn-vertex complete graph is kk-splittable. If you plot 2-splittability probability as a function of kk, it's not unimodal. If it was, then we could prove that we can generalize beyond complete graphs. In more detail, let aja_j be the probability that a random spanning tree of KnK_n is splittable into pieces of size jj and n−jn - j. This is not unimodal. Can we find a sequence related sequence bjb_j that is unimodal, or at least that we can come up with a combinatorial argument for computing them, e.g., by establishing injections/bijections relating bjb_j and bj−1b_{j - 1}.

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.