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

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 image and variance image with constants image, image depending on the specific tree family.