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

Authors:
Alois Panholzer
Affiliations:
Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstrasse 8-10/104, A-1040 Wien, Austria
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 4
Cited 0

On convergence rates in the central limit theorems for combinatorial structures

European Journal of Combinatorics
A formal system for information retrieval from files

Communications of the ACM
Varieties of Increasing Trees

CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Singularity analysis, Hadamard products, and tree recurrences

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 ~@mn and variance ~@nn with constants @m, @n depending on the specific tree family.