Skip to main content
SpringerLink
Log in

Abstract Separation Systems

  • Published:
Order Aims and scope Submit manuscript

Abstract

Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree structure theorems in graphs, matroids or CW-complexes to, potentially, image segmentation and cluster analysis. This paper is intended as a concise common reference for the basic definitions and facts about abstract separation systems in these and any future papers using this framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bowler, N., Diestel, R., Mazoit, F.: Tangle-tree duality in infinite graphs. In preparation

  2. Carmesin, J., Diestel, R., Hundertmark, F., Stein, M.: Connectivity and tree structure in finite graphs. Combinatorica 34(1), 1–35 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Diestel, R.: Tree sets. arXiv:1512.03781. To appear in Order. doi:10.1007/s11083-017-9425-4 (2017)

  4. Diestel, R.: Graph Theory (5th edition, 2016). Springer-Verlag, 2017. Electronic edition available at http://diestel-graph-theory.com/

  5. Diestel, R., Erde, J.: Tangles in abstract separation systems. In preparation

  6. Diestel, R., Erde, J., Eberenz, Ph.: Duality theorem for blocks and tangles in graphs. arXiv:1605.09139, to appear in SIAM J. Discrete Mathematics (2016)

  7. Diestel, R., Hundertmark, F., Lemanczyk, S.: Profiles of separations: in graphs, matroids, and beyond. arXiv:1110.6207, to appear in Combinatorica

  8. Diestel, R., Oum, S.: Tangle-tree duality in abstract separation systems. arXiv:1701.02509 (2017)

  9. Diestel, R., Oum, S.: Tangle-tree duality in graphs, matroids and beyond. arXiv:1701.02651 (2017)

  10. Diestel, R., Whittle, G.: Tangles and the Mona Lisa. arXiv:1603.06652 (2016)

  11. Robertson, N., Seymour, P.D.: Graph Minors. X. Obstructions to tree-decomposition. J. Combin. Theory (Series B) 52, 153–190 (1991)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hamburg University, Hamburg, Germany

    Reinhard Diestel

Authors
  1. Reinhard Diestel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Diestel, R. Abstract Separation Systems. Order 35, 157–170 (2018). https://doi.org/10.1007/s11083-017-9424-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-017-9424-5

Keywords

Search

Navigation