On the number of nonisomorphic subtrees of a tree
Combinatorics
2016-01-06 v1
Abstract
We show that a tree of order has at most 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.
Keywords
Cite
@article{arxiv.1601.00944,
title = {On the number of nonisomorphic subtrees of a tree},
author = {Éva Czabarka and László A. Székely and Stephan Wagner},
journal= {arXiv preprint arXiv:1601.00944},
year = {2016}
}