There are uncountably many topological types of locally finite trees

DOI10.1016/J.JCTB.2006.02.001MaRDI QIDQ2498745zbMATH OpenOpenAlexFDO

Authors Lilian Matthiesen

Publication date 16 August 2006

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

Full work available at URL https://doi.org/10.1016/j.jctb.2006.02.001

zbMATH Keywords

embeddinggraphlocally finite tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• A family of \(\omega_1\) topological types of locally finite trees
• There are exactly _1 topological types of locally finite trees with countably many rays
• The tree alternative conjecture under the topological minor relation
• Twin trees. II: Local structure and a universal construction
• Spanning trees of locally finite graphs

Cites work

• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3232673 (Why is no real title available?)
• On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited

Cited in

(7)

• A proof of the rooted tree alternative conjecture
• The tree alternative conjecture under the topological minor relation
• There are exactly _1 topological types of locally finite trees with countably many rays
• A family of \(\omega_1\) topological types of locally finite trees
• Twins of rayless graphs
• The number of topological types of trees
• On graph classes with minor-universal elements

This page was built for publication: There are uncountably many topological types of locally finite trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498745)