This is a preview. Log in through your library . Abstract Abstract. For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results