Balanced spanning trees of the 2-by-N grid

Abstract

We obtain an exact formula for the probability that a uniformly random spanning tree of the $2$-by-$n$ square grid is ``balanced'' in the sense that it has an edge whose removal partitions its vertices into two sets of equal size. We compute the exact limit of this probability as $n\to \infty$.

arXiv commentto appear in Involve