Ends in free minimal spanning forests
classification
🧮 math.PR
keywords
endsfreeminimalspanninganswerseveryforestforests
read the original abstract
We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.