Separations of Sets

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.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Diestel, R.: Abstract separation systems. Order 35, 157–170 (2018)

    MathSciNet  Article  Google Scholar 

  2. 2.

    Diestel, R.: Tree sets. Order 35, 171–192 (2018)

    MathSciNet  Article  Google Scholar 

  3. 3.

    Diestel, R., Hundertmark, F., Lemanczyk, S.: Profiles of separations: in graphs, matroids, and beyond. Combinatorica 39(1), 37–75 (2019)

    MathSciNet  Article  Google 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)

    MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Jakob Kneip.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Bowler, N., Kneip, J. Separations of Sets. Order 37, 411–425 (2020). https://doi.org/10.1007/s11083-019-09512-4

Download citation

Keywords

  • Graph
  • Tangle
  • Lattice
  • Partial order