Separations of sets

DOI10.1007/S11083-019-09512-4MaRDI QIDQ781544zbMATH OpenOpenAlexFDO

Authors Nathan Bowler, Jakob Kneip

Publication date 17 July 2020

Published in Order (Search for Journal in Brave)

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

zbMATH Keywords

graphlatticepartial ordertangle

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorics of partially ordered sets (06A07)

Abstract: Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as separation systems of graphs, sets, or set bipartitions.

Recommendations

• Abstract separation systems
• Profinite separation systems
• Trees of tangles in abstract separation systems
• On matroid separations of graphs
• Separating path systems

Cites work

• Abstract separation systems
• Graph minors. X: Obstructions to tree-decomposition
• Profiles of separations: in graphs, matroids, and beyond
• Tree sets

Cited in

(12)

• Profinite separation systems
• Tangle-tree duality in abstract separation systems
• Trees of tangles in abstract separation systems
• Abstract separation systems
• scientific article; zbMATH DE number 1665455 (Why is no real title available?)
• scientific article; zbMATH DE number 3864544 (Why is no real title available?)
• Separating H-sets by Open Sets
• scientific article; zbMATH DE number 3911262 (Why is no real title available?)
• scientific article; zbMATH DE number 4036600 (Why is no real title available?)
• scientific article; zbMATH DE number 5175706 (Why is no real title available?)
• Can you tell a tree from its branches?
• Separation of sets and Wolfe duality

This page was built for publication: Separations of sets

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