Year: 2019
Type: conference-paper
Abstract: We consider a procedure to reduce simply generated trees by iteratively removing all leaves. In the context of this reduction, we study the number of vertices that are deleted after applying this procedure a fixed number of times by using an additive tree parameter model combined with a recursive characterization. Our results include asymptotic formulas for mean and variance of this quantity as well as a central limit theorem.
Institution: National Research Foundation
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2887929764