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 ∼ μ n and variance ∼ ν n with constants μ , ν depending on the specific tree family.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
