Abstract
AbstractTraditionally, 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.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference35 articles.
1. Baumgartner, J.E.: Results and Independence Proofs in Combinatorial Set Theory. University of California, Berkeley (1970)
2. Bowler, N., Carmesin, J., Komjáth, P., Reiher, C.: The colouring number of infinite graphs. Combinatorica 39, 1225–1235 (2019)
3. Bowler, N., Geschke, G., Pitz, M.: Minimal obstructions for normal spanning trees. Fund. Math. 241, 245–263 (2018)
4. Brochet, J.-M., Diestel, R.: Normal tree orders for infinite graphs. Trans. Am. Math. Soc. 345(2), 871–895 (1994)
5. Bürger, C., Pitz, M.: Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths. Israel J. Math. 238, 479–500 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献