A simple existence criterion for normal spanning trees

zbMath1336.05030MaRDI QIDQ286119

Reinhard Diestel

Publication date: 20 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p33

zbMATH Keywords

infinite graphnormal spanning tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph minors (05C83) Infinite graphs (05C63)

Related Items (2)

Quickly proving Diestel's normal spanning tree criterion ⋮ Proof of Halin's normal spanning tree conjecture

Cites Work

• End spaces and spanning trees
• A proof of the bounded graph conjecture
• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• Simplicial Decompositions of Infinite Graphs
• Wurzelbäume und unendliche Wege in Graphen
• Unnamed Item

This page was built for publication: A simple existence criterion for normal spanning trees