Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2508.10614 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912770090336256 |
|---|---|
| author | Gallagher, Makenzie Tapp, Kristopher |
| author_facet | Gallagher, Makenzie Tapp, Kristopher |
| contents | 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\rightarrow\infty$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_10614 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Balanced spanning trees of the 2-by-N grid Gallagher, Makenzie Tapp, Kristopher Combinatorics Physics and Society 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\rightarrow\infty$. |
| title | Balanced spanning trees of the 2-by-N grid |
| topic | Combinatorics Physics and Society |
| url | https://arxiv.org/abs/2508.10614 |