Approximating infinite graphs by normal trees

DOI10.1016/j.jctb.2020.12.007zbMath1459.05220arXiv2002.08340OpenAlexW3120385352MaRDI QIDQ1998763

Jan Kurkofka, Ruben Melcher, Max F. Pitz

Publication date: 8 March 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

infinite graphparacompactendnormal spanning treeend space

Mathematics Subject Classification ID

Trees (05C05) Infinite graphs (05C63)

Related Items (3)

Countably determined ends and graphs ⋮ End spaces and tree-decompositions ⋮ A tree-of-tangles theorem for infinite tangles

Cites Work

• Unnamed Item
• End spaces and spanning trees
• End spaces of graphs are normal
• The end structure of a graph: Recent results and open problems
• Graph-theoretical versus topological ends of graphs.
• Trees and ultrametric spaces: A categorical equivalence
• Ends and multi-endings. I
• Ends and multi-endings. II
• Une généralisation des espaces compacts
• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• Minimal obstructions for normal spanning trees
• Wurzelbäume und unendliche Wege in Graphen

This page was built for publication: Approximating infinite graphs by normal trees