Title of article
There are uncountably many topological types of locally finite trees
Author/Authors
Matthiesen، نويسنده , , Lilian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
3
From page
758
To page
760
Abstract
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of van der Holst, we prove that there are uncountably many equivalence classes.
Keywords
graph , embedding , Locally finite tree , Bqo , Wqo
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2006
Journal title
Journal of Combinatorial Theory Series B
Record number
1527731
Link To Document