A representation theorem for end spaces of infinite graphs
Combinatorics
2024-09-02 v5
Abstract
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a special order tree. Our main proof ingredient is a structure theorem that we introduce, which carves out the order-tree-like structure of any graph in such a way that there is a natural bijection between the ends of the graph and the limit-type down-closed chains of the order-tree.
Cite
@article{arxiv.2111.12670,
title = {A representation theorem for end spaces of infinite graphs},
author = {Jan Kurkofka and Max Pitz},
journal= {arXiv preprint arXiv:2111.12670},
year = {2024}
}
Comments
28 pages