2000 character limit reached
Measurable one-ended spanning trees
Published 18 Sep 2025 in math.LO, math.CO, and math.PR | (2509.15000v1)
Abstract: We show that a one-ended, locally finite, measurable graph on a standard probability space admits a measurable one-ended spanning subtree if and only if it is measure-hyperfinite. This answers a question posed by Bowen, Poulin, and Zomback and extends recent results of Tim\'ar and Conley, Gaboriau, Marks, and Tucker-Drob.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.