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)?

First Page		Document Content
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 List Source URL: web.mat.bham.ac.uk Download Document from Source Website File Size: 42,88 KB Share Document on Facebook