Normal Spanning Trees, Aronszajn Trees and Excluded Minors

DOI10.1112/S0024610700001708zbMath1012.05051OpenAlexW2084060140MaRDI QIDQ3150978

Imre Leader, Reinhard Diestel

Publication date: 22 October 2002

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0024610700001708

zbMATH Keywords

classificationcolouring numberHalin's conjecture

Mathematics Subject Classification ID

Trees (05C05) Graph minors (05C83)

Related Items

A simple existence criterion for normal spanning trees ⋮ Proof of Halin's normal spanning tree conjecture ⋮ Topological paths, cycles and spanning trees in infinite graphs ⋮ End spaces and spanning trees ⋮ End spaces and tree-decompositions ⋮ On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ Duality theorems for stars and combs III: Undominated combs ⋮ Duality theorems for stars and combs I: Arbitrary stars and combs ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ The fundamental group of a locally finite graph with ends ⋮ Halin's end degree conjecture ⋮ The homology of a locally finite graph with ends ⋮ End spaces of graphs are normal ⋮ Minimal obstructions for normal spanning trees ⋮ A new obstruction for normal spanning trees ⋮ Approximating infinite graphs by normal trees ⋮ Decompositions of infinite graphs. II: Circuit decompositions ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory