Splittable Spanning Trees and Balanced Forests in Dense Random Graphs

David Gillman, Jacob Platnick, Dana Randall

We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges.…