Abstract
Let G be a graph and let G(n,p) be the binomial random graph with n vertices and edge probability p. We consider copies of G in G(n,p) , vertex disjoint from all other such copies. For a strictly balanced graph G, initially, every copy of G in G(n,p) is solitary. Suen (Random Struct. Algorithms 1 (1990) 231–242) established a second (disappearance) threshold for a subclass of strictly balanced graphs. In this paper we extend his result to a more general case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
