Author:
Gollin J. Pascal,Kneip Jakob
Abstract
AbstractTree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets. First we characterise those tree sets that can be represented by tree sets arising from infinite trees; these are precisely those tree sets without a chain of order type ω + 1. Then we introduce and study a topological generalisation of infinite trees which can have limit edges, and show that every infinite tree set can be represented by the tree set admitted by a suitable such tree-like space.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Characterising k-connected sets in infinite graphs;Journal of Combinatorial Theory, Series B;2022-11
2. A tree-of-tangles theorem for infinite tangles;Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg;2022-10
3. Duality theorems for stars and combs IV: Undominating stars;Journal of Graph Theory;2022-01-17
4. Canonical trees of tree-decompositions;Journal of Combinatorial Theory, Series B;2022-01
5. Trees of tangles in infinite separation systems;Mathematical Proceedings of the Cambridge Philosophical Society;2021-07-22