Applications of Order Trees in Infinite Graphs

DOI10.1007/S11083-022-09601-XMaRDI QIDQ6493755

Max F. Pitz

Publication date: 29 April 2024

Published in: Order (Search for Journal in Brave)

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites Work

• Unnamed Item
• Trees, ladders and graphs
• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• Excluding infinite minors
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Clique-sums, tree-decompositions and compactness
• On the growth rate of chromatic numbers of finite subgraphs
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
• A unified existence theorem for normal spanning trees
• The colouring number of infinite graphs
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• Minimal obstructions for normal spanning trees
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Zusammenzüge und Unterteilungen von Graphen
• Wurzelbäume und unendliche Wege in Graphen
• Non-separable Borel, sets, II
• On σ-Discreteness and Borel Isomorphism

This page was built for publication: Applications of Order Trees in Infinite Graphs