✦ LIBER ✦

Hitting time forkedge-disjoint spanning trees in a random graph

✍ Scribed by E. M. Palmer; J. J. Spencer

Publisher: Springer Netherlands
Year: 1995
Tongue: English
Weight: 236 KB
Volume: 31
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf01882200

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge disjoint spanning trees in random g

Edge disjoint spanning trees in random graphs

✍ A. M. Frieze; T. Łuczak 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 145 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w