The Complexity of Proper Homotopy Equivalence of Graphs

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hoganson, Hannah, Zomback, Jenna
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911259959492608
author Hoganson, Hannah
Zomback, Jenna
author_facet Hoganson, Hannah
Zomback, Jenna
contents We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the homeomorphism relation of noncompact surfaces with pants decompositions.
format Preprint
id arxiv_https___arxiv_org_abs_2410_00901
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The Complexity of Proper Homotopy Equivalence of Graphs
Hoganson, Hannah
Zomback, Jenna
Logic
General Topology
Geometric Topology
03E15, 54H05, 57M99
We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the homeomorphism relation of noncompact surfaces with pants decompositions.
title The Complexity of Proper Homotopy Equivalence of Graphs
topic Logic
General Topology
Geometric Topology
03E15, 54H05, 57M99
url https://arxiv.org/abs/2410.00901