#5 Combinatorics of splittability on K_n
Statement
There is also a lower bound for the probability that a uniformly random spanning tree of an -vertex complete graph is -splittable. If you plot 2-splittability probability as a function of , it's not unimodal. If it was, then we could prove that we can generalize beyond complete graphs. In more detail, let be the probability that a random spanning tree of is splittable into pieces of size and . This is not unimodal. Can we find a sequence related sequence 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 and .
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.