Quickly proving Diestel's normal spanning tree criterion

DOI10.37236/9619zbMath1478.05024arXiv2006.02994OpenAlexW3203142158MaRDI QIDQ820854

Max F. Pitz

Publication date: 28 September 2021

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

Full work available at URL: https://arxiv.org/abs/2006.02994

zbMATH Keywords

Diestel's criterion

Mathematics Subject Classification ID

Trees (05C05) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• A simple existence criterion for normal spanning trees
• A unified existence theorem for normal spanning trees
• Elementary submodels in infinite combinatorics
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Simplicial Decompositions of Infinite Graphs
• Wurzelbäume und unendliche Wege in Graphen

This page was built for publication: Quickly proving Diestel's normal spanning tree criterion