Abstract
Similar to topological spaces, we introduce the Cantor-Bendixson rank of a tree by repeatedly removing the leaves and the isolated vertices of using transfinite recursion. Then, we give a representation of a tree as a leafless tree with some leafy trees attached to . With this representation at our disposal, we count the siblings of a tree and obtain partial results towards a conjecture of Bonato and Tardif.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.