Random trees in a graph and trees in a random graph
Published online by Cambridge University Press: 24 October 2008
Extract
This paper treats two related sets of problems in the theory of random graphs. In Sections 2 and 3 we study random spanning subtrees of a complete graph (or, equivalently, random labelled trees). It is shown that the number of common edges of two such random trees asymptotically has a Poisson distribution with expectation 2. Similar results are obtained for the number of edges in the intersection or union of more than two random trees.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 100 , Issue 2 , September 1986 , pp. 319 - 330
- Copyright
- Copyright © Cambridge Philosophical Society 1986
References
REFERENCES
- 4
- Cited by