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

Abstract. We study for various tree families the distribution of the number of edgedisjoint 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

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Alois Panholzer
• Keywords: DAM 2008, Edgedisjoint Paths, Tree, Various Tree