Skip to main content
Download PDF

Representations of Infinite Tree Sets

Order volume 38, pages 79–96 (2021)Cite this article

Abstract

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets. First we characterise those tree sets that can be represented by tree sets arising from infinite trees; these are precisely those tree sets without a chain of order type ω + 1. Then we introduce and study a topological generalisation of infinite trees which can have limit edges, and show that every infinite tree set can be represented by the tree set admitted by a suitable such tree-like space.

References

  1. Bowler, N., Carmesin, J., Christian, R.: Infinite graphic matroids. Combinatorica 38(2), 305–339 (2018). https://doi.org/10.1007/s00493-016-3178-3. MR3800843

    MathSciNet  Article  MATH  Google Scholar 

  2. Diestel, R.: Abstract separation systems. Order 35(1), 157–170 (2018). https://doi.org/10.1007/s11083-017-9424-5. MR3774512

    MathSciNet  Article  MATH  Google Scholar 

  3. Diestel, R.: Tree sets. Order 35(1), 171–192 (2018). https://doi.org/10.1007/s11083-017-9425-4. MR3774513

    MathSciNet  Article  MATH  Google Scholar 

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

  5. Diestel, R., Oum, S.: Tangle-tree duality: in graphs, matroids and beyond. Combinatorica 39(4), 879–910 (2019). https://doi.org/10.1007/s00493-019-3798-5. MR4015355

    MathSciNet  Article  MATH  Google Scholar 

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

  7. Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52(2), 153–190 (1991). https://doi.org/10.1016/0095-8956(91)90061-N. MR1110468

    MathSciNet  Article  MATH  Google Scholar 

  8. Robertson, N., Seymour, P., Thomas, R.: Excluding infinite minors. Discrete Math. 95(1-3), 303–319 (1991). https://doi.org/10.1016/0012-365X(91)90343-Z. Directions in infinite graph theory and combinatorics (Cambridge, 1989), MR1141945

    MathSciNet  Article  MATH  Google Scholar 

  9. Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58(1), 22–33 (1993). https://doi.org/10.1006/jctb.1993.1027. MR1214888

    MathSciNet  Article  MATH  Google Scholar 

  10. Thomassen, C., Vella, A.: Graph-like continua, augmenting arcs, and Menger’s theorem. Combinatorica 28(5), 595–623 (2008). https://doi.org/10.1007/s00493-008-2342-9. MR2501250

    MathSciNet  Article  MATH  Google Scholar 

Download references

Acknowledgements

We would like to thank Nathan Bowler for greatly simplifying our proof of Theorem 4.6 by pointing out the redundancy of the extra condition in the definition of pseudo-arc (cf. Lemma 4.3).

Author information

Authors and Affiliations

  1. Discrete Mathematics Group, Institute for Basic Science (IBS), 55 Expo-ro, Yuseong-gu, Daejeon, 34126, Korea

    J. Pascal Gollin

  2. Fachbereich Mathematik, Universität Hamburg, Bundesstraße 55, 20146, Hamburg, Germany

    Jakob Kneip

Authors
  1. J. Pascal Gollin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakob Kneip
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Pascal Gollin.

Additional information

Publisher’s Note

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

The first author was supported by the Institute for Basic Science (IBS-R029-C1).

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Gollin, J.P., Kneip, J. Representations of Infinite Tree Sets. Order 38, 79–96 (2021). https://doi.org/10.1007/s11083-020-09529-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-020-09529-0

Keywords

  • Trees
  • Tree sets
  • Tree-like spaces
  • Infinite graphs