Tree sets

DOI10.1007/S11083-017-9425-4MaRDI QIDQ2413420zbMATH OpenOpenAlexFDO

Authors 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

bipartitionfinite separation systemgraphmatroidnested subsetsorderposetprotreetreetree decompositiontree set isomorphism

Mathematics Subject Classification ID

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

Abstract: We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and matroids etc. Unlike graph-theoretical or order trees, these _tree sets_ can provide a suitable formalization of tree structure also for infinite graphs, matroids, and set partitions. Order trees reappear as oriented tree sets. We show how each of the above structures defines a tree set, and which additional information, if any, is needed to reconstruct it from this tree set.

Recommendations

• Representations of infinite tree sets
• Trees of tangles in abstract separation systems
• scientific article; zbMATH DE number 1746894
• TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
• The structure of 2-separations of infinite matroids

Cites work

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

Cited in

(23)

• A tree-of-tangles theorem for infinite tangles
• 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
• Profinite separation systems
• Propagation tree decompositions and linearly independent vertices
• Tangle-tree duality in abstract separation systems
• Trees of tangles in abstract separation systems
• Trees and B-series
• Structural submodularity and tangles in abstract separation systems
• Acyclic, connected and tree sets
• Abstract separation systems
• Object oriented data analysis: sets of trees
• Representations of infinite tree sets
• scientific article; zbMATH DE number 475613 (Why is no real title available?)
• scientific article; zbMATH DE number 1746894 (Why is no real title available?)
• On structural descriptions of lower ideals of trees
• Entanglements
• Efficiently distinguishing all tangles in locally finite graphs
• Refining trees of tangles in abstract separation systems: inessential parts
• Characterising 4-tangles through a connectivity property
• Refining tree-decompositions so that they display the k-blocks
• Optimal trees of tangles: refining the essential parts
• Separations of sets

This page was built for publication: Tree sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413420)