A Cantor-Bendixson Rank for Siblings of Trees

preprint2022arXivOpen access

Abstract

Similar to topological spaces, we introduce the Cantor-Bendixson rank of a tree TT by repeatedly removing the leaves and the isolated vertices of TT using transfinite recursion. Then, we give a representation of a tree TT as a leafless tree T∞T^\infty with some leafy trees attached to T∞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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.