A Cantor-Bendixson rank for siblings of trees
The electronic journal of combinatorics, Tome 30 (2023) no. 2
Similar to topological spaces, we introduce the Cantor-Bendixson rank of a tree $T$ by repeatedly removing the leaves and the isolated vertices of $T$ using transfinite recursion. Then, we give a representation of a tree $T$ as a leafless tree $T^\infty$ with some leafy trees attached to $T^\infty$. With this representation at our disposal, we count the siblings of a tree and obtain partial results towards a conjecture of Bonato and Tardif.
DOI :
10.37236/11537
Classification :
05C05, 05C10
Mots-clés : rayless tree, self-embedding, Bonato-Tardif conjecture
Mots-clés : rayless tree, self-embedding, Bonato-Tardif conjecture
Affiliations des auteurs :
Davoud Abdi  1
@article{10_37236_11537,
author = {Davoud Abdi},
title = {A {Cantor-Bendixson} rank for siblings of trees},
journal = {The electronic journal of combinatorics},
year = {2023},
volume = {30},
number = {2},
doi = {10.37236/11537},
zbl = {1516.05026},
url = {http://geodesic.mathdoc.fr/articles/10.37236/11537/}
}
Davoud Abdi. A Cantor-Bendixson rank for siblings of trees. The electronic journal of combinatorics, Tome 30 (2023) no. 2. doi: 10.37236/11537
Cité par Sources :