Representations of infinite tree sets
From MaRDI portal
Publication:2663170
Abstract: Tree 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 . 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.
Recommendations
- scientific article; zbMATH DE number 1538031
- scientific article; zbMATH DE number 475420
- scientific article; zbMATH DE number 4213466
- scientific article; zbMATH DE number 18386
- Representability of trees and some of their applications
- Fixed elements of infinite trees
- scientific article; zbMATH DE number 708666
- On the representation of a set by additive trees
- Unification of kinded infinite trees
- Theory of finite or infinite trees revisited
Cites work
- Abstract separation systems
- Excluding infinite minors
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Graph-like continua, augmenting arcs, and Menger's theorem
- Infinite graphic matroids
- Tangle-tree duality in abstract separation systems
- Tangle-tree duality: in graphs, matroids and beyond
- Tree sets
Cited in
(12)- A tree-of-tangles theorem for infinite tangles
- Characterising \(k\)-connected sets in infinite graphs
- Tree sets
- Canonical trees of tree-decompositions
- scientific article; zbMATH DE number 1696804 (Why is no real title available?)
- scientific article; zbMATH DE number 4213466 (Why is no real title available?)
- Representing models by finite trees
- Trees of tangles in infinite separation systems
- Infinite towers of tree lattices
- Duality theorems for stars and combs IV: Undominating stars
- Efficiently distinguishing all tangles in locally finite graphs
- Representing trees of higher degree
This page was built for publication: Representations of infinite tree sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663170)