Ends as tangles
Combinatorics
2025-05-16 v2
Abstract
Every end of an infinite graph defines a tangle of infinite order in . These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite , the ends whose induced tangles of order are closed. They are precisely the tangles for which there is a set of vertices that decides by majority vote. Such a set exists if and only if the vertex degree plus the number of dominating vertices of is at least .
Cite
@article{arxiv.1909.12628,
title = {Ends as tangles},
author = {Jay Lilian Kneip},
journal= {arXiv preprint arXiv:1909.12628},
year = {2025}
}