ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a given family of graphs (like grids, complete graphs), what is the assymptotic probability a uniformly random spanning tree versus a random minimal spanning tree is 2-splittable?

(a) Is it true that on any graph a random MST is weakly less likely to be 2-splittable?

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.