Abstract
Traditionally, the trees studied in infinite graphs are trees of height at most ω, with each node adjacent to its parent and its children (and every branch of the tree inducing a path or a ray). However, there is also a method, systematically introduced by Brochet and Diestel, of turning arbitrary well-founded order trees T into graphs, in a way such that every T-branch induces a generalised path in the sense of Rado. This article contains an introduction to this method and then surveys four recent applications of order trees to infinite graphs, with relevance for well-quasi orderings, Hadwiger’s conjecture, normal spanning trees and end-structure, the last two addressing long-standing open problems by Halin.
Article PDF
Similar content being viewed by others
Data availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Baumgartner, J.E.: Results and Independence Proofs in Combinatorial Set Theory. University of California, Berkeley (1970)
Bowler, N., Carmesin, J., Komjáth, P., Reiher, C.: The colouring number of infinite graphs. Combinatorica 39, 1225–1235 (2019)
Bowler, N., Geschke, G., Pitz, M.: Minimal obstructions for normal spanning trees. Fund. Math. 241, 245–263 (2018)
Brochet, J.-M., Diestel, R.: Normal tree orders for infinite graphs. Trans. Am. Math. Soc. 345(2), 871–895 (1994)
Bürger, C., Pitz, M.: Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths. Israel J. Math. 238, 479–500 (2020)
Diestel, R.: Graph Theory, 5th edn. Springer, Berlin (2015)
Diestel, R., Leader, I.: Normal spanning trees, Aronszajn trees and excluded minors. J. Lond. Math. Soc. 63(1), 16–32 (2001)
Elekes, M., Soukup, D. T., Soukup, L., Szentmiklóssy, Z.: Decompositions of edge-colored infinite complete graphs into monochromatic paths. Discret. Math. 340(8), 2053–2069 (2017)
Geschke, S., Kurkofka, J., Melcher, R., Pitz, M.: Halin’s end degree conjecture. Israel J. Math. (2021)
Hajnal, A.: The chromatic number of the product of two ℵ1-chromatic graphs can be countable. Combinatorica 5(2), 137–139 (1985)
Halin, R.: Über die Maximalzahl fremder unendlicher Wege in Graphen. Mathematische Nachrichten 30(1–2), 63–85 (1965)
Halin, R.: Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer zahl. In: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 31, pp. 156–165. Springer (1967)
Halin, R.: Simplicial decompositions of infinite graphs. In: Annals of Discrete Mathematics, vol. 3, pp. 93–109. Elsevier (1978)
Halin, R.: Miscellaneous problems on infinite graphs. J. Graph Theory 35(2), 128–151 (2000)
Jech, T.: Set theory, The Third Millennium Edition Springer Monographs in Mathematics (2013)
Jung, H.: Wurzelbäume und unendliche Wege in Graphen. Math. Nachr. 41, 1–22 (1969)
Jung, H.A.: Zusammenzüge und Unterteilungen von Graphen. Mathematische Nachrichten 35(5-6), 241–267 (1967)
Komjáth, P.: A note on minors of uncountable graphs. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 117, pp 7–9 (1995)
Komjáth, P.: Hadwiger’s conjecture for uncountable graphs. In: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 87, pp. 337–341. Springer (2017)
Kriz, I., Thomas, R.: Clique-sums, tree-decompositions and compactness. Discrete Math. 81(2), 177–185 (1990)
Lambie-Hanson, C.: On the growth rate of chromatic numbers of finite subgraphs. Adv. Math. 369, 107176 (2020)
Nash-Williams, C.S.J.: On well-quasi-ordering infinite trees. In: Mathematical proceedings of the cambridge philosophical society, vol. 61, pp 697–720. Cambridge University Press (1965)
Pitz, M.: A new obstruction for normal spanning trees. Bull. London Math. Soc. 53, 1220–1227 (2021)
Pitz, M.: A note on minor antichains of uncountable graphs. arXiv:2005.05816 (2020)
Pitz, M.: Quickly proving Diestel’s normal spanning tree criterion. Electron. J. Comb. 28(3), P3.59 (2021)
Pitz, M.: A unified existence theorem for normal spanning trees. J. Comb. Theory Series B 145, 466–469 (2020)
Pitz, M.: Proof of Halin’s normal spanning tree conjecture. Israel J. Math. 246, 353–370 (2021)
Rado, R.: Monochromatic paths in graphs. In: Annals of discrete mathematics, vol. 3, pp. 191–194. Elsevier (1978)
Robertson, N., Seymour, P., Thomas, R.: Excluding infinite minors. Discret. Math. 95(1-3), 303–319 (1991)
Soukup, D.T.: Trees, Ladders and graphs. J. Comb. Theory, Series B 115, 96–116 (2015)
Soukup, D.T.: Decompositions of edge-coloured infinite complete graphs into monochromatic paths II. Israel J. Math. 221(1), 235–273 (2017)
Stone, A.H.: On σ-discreteness and Borel isomorphism. Am. J. Math. 85(4), 655–666 (1963)
Stone, A.H.: Non-separable Borel sets, II. Gen. Topol. Appl. 2(3), 249–270 (1972)
Thomas, R.: A counter-example to Wagner’s conjecture for infinite graphs. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 103, pp. 55–57. Cambridge University Press (1988)
Todorcevic, S.: On a conjecture of R. Rado. J. London Math. Soc.(2) 27(1), 1–8 (1983)
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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/.
About this article
Cite this article
Pitz, M. Applications of Order Trees in Infinite Graphs. Order (2022). https://doi.org/10.1007/s11083-022-09601-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11083-022-09601-x