On the number of nonisomorphic subtrees of a tree
Czabarka, Éva · Székely, László A. · Wagner, Stephan
Original · EN
We show that a tree of order n has at most O(5ⁿ/⁴) nonisomorphic subtrees, and that this bound is best possible. We also prove an analogous result for the number of nonisomorphic rooted subtrees of a rooted tree.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.