Geodesic
Tree-like graphings, wallings, and median graphings of equivalence relations
Forum of Mathematics, Sigma, Tome 13 (2025) no. 1, p. e64

Voir la notice de l'article provenant de la source Cambridge University Press

We prove several results showing that every locally finite Borel graph whose large-scale geometry is ‘tree-like’ induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs (i.e., CAT(0) cube complexes). Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty–Jackson–Kechris. 
Chen, Ruiyuan; Poulin, Antoine; Tao, Ran; Tserunyan, Anush. Tree-like graphings, wallings, and median graphings of equivalence relations. Forum of Mathematics, Sigma, Tome 13 (2025) no. 1, p. e64. doi: 10.1017/fms.2025.22
@article{10_1017_fms_2025_22,
     author = {Chen, Ruiyuan and Poulin, Antoine and Tao, Ran and Tserunyan, Anush},
     title = {Tree-like graphings, wallings, and median graphings of equivalence relations},
     journal = {Forum of Mathematics, Sigma},
     pages = {e64},
     year = {2025},
     volume = {13},
     number = {1},
     doi = {10.1017/fms.2025.22},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/fms.2025.22/}
}
TY  - JOUR
AU  - Chen, Ruiyuan
AU  - Poulin, Antoine
AU  - Tao, Ran
AU  - Tserunyan, Anush
TI  - Tree-like graphings, wallings, and median graphings of equivalence relations
JO  - Forum of Mathematics, Sigma
PY  - 2025
SP  - e64
VL  - 13
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/fms.2025.22/
DO  - 10.1017/fms.2025.22
ID  - 10_1017_fms_2025_22
ER  - 
%0 Journal Article
%A Chen, Ruiyuan
%A Poulin, Antoine
%A Tao, Ran
%A Tserunyan, Anush
%T Tree-like graphings, wallings, and median graphings of equivalence relations
%J Forum of Mathematics, Sigma
%D 2025
%P e64
%V 13
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/fms.2025.22/
%R 10.1017/fms.2025.22
%F 10_1017_fms_2025_22

[Ada90] Adams, S., ‘Trees and amenable equivalence relations’, Ergodic Theory Dynam. Systems 10(1) (1990), 1–14. Google Scholar

[BC24] Banerjee, R. and Chen, R., ‘Structurable equivalence relations and interpretations’, Preprint, 2024, . Google Scholar | arXiv

[BH83] Bandelt, H.-J. and Hedlíková, J., ‘Median algebras’, Discrete Math. 45(1) (1983), 1–30. Google Scholar

[Bow22] Bowditch, B. H., ‘Median algebras’, Preprint, 2022, https://homepages.warwick.ac.uk/~masgak/papers/median-algebras.pdf. Google Scholar

[Car15] Carmesin, J., ‘Tree-decompositions of finite and infinite graphs’, PhD dissertation, Staats-und Universitätsbibliothek Hamburg Carl von Ossietzky, 2015. Google Scholar

[CGMTD21] Conley, C. T., Gaboriau, D., Marks, A. S. and Tucker-Drob, R. D., ‘One-ended spanning subforests and treeability of groups’, Preprint 2021, . Google Scholar | arXiv

[CK18] Chen, R. and Kechris, A. S., ‘Structurable equivalence relations’, Fund. Math. 242(2) (2018), 109–185. Google Scholar | DOI

[CN05] Chatterji, I. and Niblo, G., ‘From wall spaces to cube complexes’, Internat. J. Algebra Comput. 15(5–6) (2005), 875–885. Google Scholar

[Die17] Diestel, R., Graph Theory (Graduate Texts in Mathematics) vol. 173, fifth edn. (Springer, Berlin, 2017). Google Scholar

[DJK94] Dougherty, R., Jackson, S. and Kechris, A. S., ‘The structure of hyperfinite Borel equivalence relations’, Trans. Amer. Math. Soc. 341(1) (1994), 193–225. Google Scholar | DOI

[DK03] Diestel, R. and Kühn, D., ‘Graph-theoretical versus topological ends of graphs’, in vol. 87 (2003), 197–206. Dedicated to Crispin St. J. A. Nash-Williams. Google Scholar

[DK18] Druţu, C. and Kapovich, M., Geometric Group Theory (American Mathematical Society Colloquium Publications) vol. 63 (American Mathematical Society, Providence, RI, 2018). With an appendix by Bogdan Nica. Google Scholar

[Fre31] Freudenthal, H., ‘Über die Enden topologischer Räume und Gruppen’, Math. Z. 33(1) (1931), 692–713. Google Scholar | DOI

[Gab00] Gaboriau, D., ‘Coût des relations d’équivalence et des groupes’, Invent. Math. 139(1) (2000), 41–98. Google Scholar | DOI

[GdlH90] Ghys, É. and De La Harpe, P. (eds.), Sur les groupes hyperboliques d’après Mikhael Gromov (Progress in Mathematics) vol. 83 (Birkhäuser Boston, Inc., Boston, MA, 1990). Papers from the Swiss Seminar on Hyperbolic Groups held in Bern, 1988. Google Scholar

[Ghy95] Ghys, É., ‘Topologie des feuilles génériques’, Ann. of Math. (2) 141(2) (1995), 387–422. Google Scholar | DOI

[GL09] Gaboriau, D. and Lyons, R., ‘A measurable-group-theoretic solution to von Neumann’s problem’, Invent. Math. 177(3) (2009), 533–540. Google Scholar | DOI

[Gro93] Gromov, M., ‘Asymptotic invariants of infinite groups’, in Geometric Group Theory, Vol. 2 (Sussex, 1991) (London Math. Soc. Lecture Note Ser.) vol. 182 (Cambridge Univ. Press, Cambridge, 1993), 1–295. Google Scholar

[Hal64] Halin, R., ‘Über unendliche Wege in Graphen’, Math. Ann. 157 (1964), 125–137. Google Scholar | DOI

[Hjo06] Hjorth, G., ‘A lemma for cost attained’, Ann. Pure Appl. Logic 143(1–3) (2006), 87–102. Google Scholar | DOI

[Hjo12] Hjorth, G., ‘Treeable equivalence relations’, J. Math. Log. 12(1) (2012), 1250003, 21. Google Scholar

[Hop44] Hopf, H., ‘Enden offener Räume und unendliche diskontinuierliche Gruppen’, Comment. Math. Helv. 16 (1944), 81–100. Google Scholar | DOI

[HSS20] Huang, J., Sabok, M. and Shinko, F., ‘Hyperfiniteness of boundary actions of cubulated hyperbolic groups’, Ergodic Theory Dynam. Systems 40(9) (2020), 2453–2466. Google Scholar

[HW08] Haglund, F. and Wise, D. T., ‘Special cube complexes’, Geom. Funct. Anal. 17(5) (2008), 1551–1620. Google Scholar | DOI

[Isb80] Isbell, J. R., ‘Median algebra’, Trans. Amer. Math. Soc. 260(2) (1980), 319–362. Google Scholar | DOI

[JKL02] Jackson, S., Kechris, A. S. and Louveau, A., ‘Countable Borel equivalence relations’, J. Math. Log. 2(1) (2002), 1–80. Google Scholar | DOI

[Joh82] Johnstone, P. T., Stone Spaces (Cambridge Studies in Advanced Mathematics) vol. 3 (Cambridge University Press, Cambridge, 1982). Google Scholar

[JS23] Jardón-Sánchez, H., ‘Applications of tree decompositions and accessibility to treeability of borel graphs, Preprint, 2023, . Google Scholar | arXiv

[Kec24] Kechris, A. S., The Theory of Countable Borel Equivalence Relations (Cambridge Tracts in Mathematics) vol. 234 (Cambridge University Press, Cambridge, 2024). Google Scholar | DOI

[KM04] Kechris, A. S. and Miller, Benjamin D., Topics in Orbit Equivalence (Lecture Notes in Mathematics) vol. 1852 (Springer-Verlag, Berlin, 2004). Google Scholar | DOI

[KM08] Krön, B. and Möller, R. G., ‘Quasi-isometries between graphs and trees’, J. Combin. Theory Ser. B 98(5) (2008), 994–1013. Google Scholar | DOI

[KM20] Kechris, A. S. and Marks, A. S., ‘Descriptive graph combinatorics’, Preprint, 2020, http://math.caltech.edu/~kechris/papers/combinatorics20book.pdf. Google Scholar

[KST99] Kechris, A. S., Solecki, S. and Todorcevic, S., ‘Borel chromatic numbers’, Adv. Math. 141(1) (1999), 1–44. Google Scholar | DOI

[Mil08] Miller, B. D., ‘Ends of graphed equivalence relations, I’, Israel J. Math. 169(1) (2008), 375. Google Scholar | DOI

[Mil12] Miller, B., ‘Incomparable treeable equivalence relations’, J. Math. Log. 12(1) (2012), 1250004, 11. Google Scholar

[Nic04] Nica, B., ‘Cubulating spaces with walls’, Algebr. Geom. Topol. 4 (2004), 297–309. Google Scholar | DOI

[Pik21] Pikhurko, O., ‘Borel combinatorics of locally finite graphs’, in Surveys in Combinatorics (London Math. Soc. Lecture Note Ser.) vol. 470 (Cambridge University Press, Cambridge, 2021), 267–319. Google Scholar

[Roe03] Roe, J., Lectures on Coarse Geometry (University Lecture Series) vol. 31 (American Mathematical Society, Providence, RI, 2003). Google Scholar

[Rol98] Roller, M., ‘Poc sets, median algebras and group actions’, PhD dissertation, Universität Regensburg, 1998. Google Scholar

[RS91] Robertson, N. and Seymour, P. D., ‘Graph minors. X. Obstructions to tree-decomposition’, J. Combin. Theory Ser. B 5 (2) (1991), 153–190. Google Scholar | DOI

[Sta71] Stallings, J., Group Theory and Three-Dimensional Manifolds vol. 4. (Yale University Press, New Haven, Conn.-London, 1971). A James K. Whittemore Lecture in Mathematics given at Yale University, 1969. Google Scholar

[Tse20] Tserunyan, A., ‘A descriptive construction of trees and Stallings’ theorem’, in Trends in Set Theory (Contemp. Math.) vol. 752 (Amer. Math. Soc., Providence, RI, 2020), 191–207. Google Scholar | DOI

[vdV93] Van De Vel, M. L. J., Theory of Convex Structures (North-Holland Mathematical Library) vol. 50 (North-Holland Publishing Co., Amsterdam, 1993). Google Scholar | DOI

[Wer81] Werner, H., ‘A duality for weakly associative lattices’, in Finite Algebra and Multiple-Valued Logic (Szeged, 1979) (Colloq. Math. Soc. János Bolyai, 1981) 781–808. Google Scholar

Cité par Sources :