![](https://www.pdfsearch.io/img/be20ac35c04af60f6532d8f6efa91b13.jpg) Date: 2014-10-09 03:30:03
| | Spanning Trees in Random Graphs Richard Montgomery (University of Cambridge) Given a tree T with n vertices, how large does p need to be for it to be likely that a copy of T appears in the binomial random graph G(n, p)? Add to Reading ListSource URL: web.mat.bham.ac.ukDownload Document from Source Website File Size: 42,88 KBShare Document on Facebook
|