English

Ends as tangles

Combinatorics 2025-05-16 v2

Abstract

Every end of an infinite graph G G defines a tangle of infinite order in G G . 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 k k , the ends ω \omega whose induced tangles of order k k are closed. They are precisely the tangles τ \tau for which there is a set of k k vertices that decides τ \tau by majority vote. Such a set exists if and only if the vertex degree plus the number of dominating vertices of ω \omega is at least k k .

Keywords

Cite

@article{arxiv.1909.12628,
  title  = {Ends as tangles},
  author = {Jay Lilian Kneip},
  journal= {arXiv preprint arXiv:1909.12628},
  year   = {2025}
}
R2 v1 2026-06-23T11:28:02.725Z