DETERMINATION OF LARGE FAMILIES AND DIAMETER OF EQUISEPARABLE TREES

Abstract

We consider the problem of determining all the members of an arbitrary family of equiseparable trees. We introduce the concept of satura- tion (based on the number partitions). After that, we use the same concept to obtain the least upper bound for the difference in the diameters of two equi- separable trees with m edges. We prove that this bound is equal to (m� 4)/3, where m is the size of trees.