Halin's end degree conjecture

DOI10.1007/s11856-022-2368-5OpenAlexW4306945384WikidataQ123004798 ScholiaQ123004798MaRDI QIDQ2698436

Ruben Melcher, Jan Kurkofka, Stefan Geschke, Max F. Pitz

Publication date: 24 April 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05Cxx) Mathematical logic and foundations (03-XX) Set theory (03Exx)

Related Items (1)

A strengthening of Halin's grid theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of Halin's grid theorem
• Proof of Halin's normal spanning tree conjecture
• Characterising \(k\)-connected sets in infinite graphs
• The colouring number of infinite graphs
• Walks on ordinals and their characteristics
• Graph Theory
• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• Normal Tree Orders for Infinite Graphs
• Minimal obstructions for normal spanning trees
• Set Theory
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Zusammenzüge und Unterteilungen von Graphen

This page was built for publication: Halin's end degree conjecture