A distributional study of the path edge-covering numbers for random trees

We study for various tree families the distribution of the number of edge-disjoint paths required to cover the edges of a random tree of size n  . For all tree families considered we can show a central limit theorem with expectation ∼μn∼μn and variance ∼νn∼νn with constants μμ, νν depending on the specific tree family.