EUVIMEDEUVIMED entdecken
Crossref

A metrization theorem for edge-end spaces of infinite graphs

Max Pitz

Proceedings of the American Mathematical Society · 13.03.2026 · 154 (5) · 2209-2219

DOI: 10.1090/proc/17532 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, online erschienen am 13.03.2026. Verfasst von Max Pitz. Die Arbeit nennt 27 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove that the edge-end space of an infinite graph is metrizable if and only if it is first countable. This strengthens a recent result by Aurichi, Magalhaes Jr. and Real [Preprint, arXiv:2404.17116 , 2024]. Our central graph-theoretic tool is the use of tree-cut decompositions, introduced by Wollan [J. Comb. Theory Ser. B 110 (2015), 47–66] as a variation of tree-decompositions that is based on edge cuts instead of vertex separations. In particular, we give a new, elementary proof for Kurkofka’s result [Math. Ann. 382 (2022), 1881–1900] that every infinite graph has a tree-cut decomposition of finite adhesion into its ω \omega -edge blocks. Along the way, we also give a new, short proof for a classic result by Halin [Advances in Graph Theory, Annals of Discrete Mathematics, vol. 3. pp. 98–109, Elsevier, 1978] on K k , κ K_{k,\kappa } -subdivisions in k k -connected graphs, making this paper self-contained.

Zitieren

APA

Pitz, M. (2026). A metrization theorem for edge-end spaces of infinite graphs. Proceedings of the American Mathematical Society, 154(5), 2209-2219. https://doi.org/10.1090/proc/17532

Vancouver

Pitz M. A metrization theorem for edge-end spaces of infinite graphs. Proceedings of the American Mathematical Society. 2026;154(5):2209-2219. doi:10.1090/proc/17532

BibTeX
@article{Pitz2026,
  author = {Pitz, Max},
  title = {A metrization theorem for edge-end spaces of infinite graphs},
  journal = {Proceedings of the American Mathematical Society},
  year = {2026},
  volume = {154},
  number = {5},
  pages = {2209--2219},
  doi = {10.1090/proc/17532}
}
Kostenlos starten →