Tree sets

DOI10.1007/S11083-017-9425-4zbMath1412.06002arXiv1512.03781OpenAlexW3037565320MaRDI QIDQ2413420

Reinhard Diestel

Publication date: 10 April 2018

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.03781

zbMATH Keywords

treegraphposetordertree decompositionmatroidbipartitionfinite separation systemnested subsetsprotreetree set isomorphism

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (12)

Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ Characterising \(k\)-connected sets in infinite graphs ⋮ Representations of infinite tree sets ⋮ Abstract separation systems ⋮ Profinite separation systems ⋮ Entanglements ⋮ Tangle-tree duality in abstract separation systems ⋮ Trees of tangles in abstract separation systems ⋮ Efficiently distinguishing all tangles in locally finite graphs ⋮ Structural submodularity and tangles in abstract separation systems ⋮ Separations of sets ⋮ A tree-of-tangles theorem for infinite tangles

Cites Work

• Inaccessible groups and protrees
• Graphs and groups with tree-like properties
• Graph searching and a min-max theorem for tree-width
• Profinite separation systems
• Tangle-tree duality in abstract separation systems
• Tangle-tree duality: in graphs, matroids and beyond
• Abstract separation systems
• Profiles of separations: in graphs, matroids, and beyond
• Representations of infinite tree sets
• Graph Theory
• Groups Acting on Protrees
• Duality Theorems for Blocks and Tangles in Graphs

This page was built for publication: Tree sets