Advertisement

Order

pp 1–15 | Cite as

Separations of Sets

  • Nathan Bowler
  • Jakob KneipEmail author
Article
  • 7 Downloads

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.

Keywords

Graph Tangle Lattice Partial order 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

References

  1. 1.
    Diestel, R.: Abstract separation systems. Order 35, 157–170 (2018)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Diestel, R.: Tree sets. Order 35, 171–192 (2018)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Diestel, R., Hundertmark, F., Lemanczyk, S.: Profiles of separations: in graphs, matroids, and beyond. Combinatorica 39(1), 37–75 (2019)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Diestel, R., Oum, S.: Tangle-tree duality in abstract separation systems. Submitted, arXiv:1701.02509 (2017)
  5. 5.
    Diestel, R., Whittle, G.: Tangles and the Mona Lisa. arXiv:1603.06652
  6. 6.
    Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory (Series B) 52, 153–190 (1991)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature B.V. 2019

Authors and Affiliations

  1. 1.Hamburg UniversityHamburgGermany

Personalised recommendations