树的Cantor-Bendixson秩
A Cantor-Bendixson Rank for Siblings of Trees
摘要：
类似于拓扑空间，我们通过使用超限递归反复移除$T$的叶子和孤立点来引入树$T$的Cantor-Bendixson秩。然后，我们给出了一个表示的树$T$作为一个无叶树$T^\infty$与一些树叶树连接到$T^\infty$。有了这个表示在我们的处置，我们数的兄弟姐妹的树，并获得部分结果对一个猜想的Bonato和Tardif。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
