Learn More
We study here, by using a recursive approach, the number of random cuts that are necessary to destroy a random tree of size n for simply generated tree families. Crucial for the applicability of such(More)
We study, for the family of recursive trees, two procedures that destroy trees by successively removing edges. In both variants, one starts with a tree T of size n and chooses one of the n − 1 edges(More)