A descriptive construction of trees and stallings’ theorem

Anush Tserunyan

Research output: Contribution to journalArticlepeer-review

Abstract

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings’ theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws ideas from [Krö10] it is written in a way that easily adapts to the setting of countable Borel equivalence relations, leading to a free decomposition result and a sufficient condition for treeability.

Original languageEnglish (US)
Pages (from-to)191-207
Number of pages17
JournalContemporary Mathematics
Volume752
DOIs
StatePublished - 2020

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'A descriptive construction of trees and stallings’ theorem'. Together they form a unique fingerprint.

Cite this