Abstract
The k-core, defined as the largest subgraph of minimum degree k, of the random graph G(n,p) has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [Journal of Combinatorial Theory, Series B 67 (1996) 111–151] determined the threshold dk for the appearance of an extensive k-core. Here we derive a multi-type Galton-Watson branching process that describes precisely how the k-core is “embedded” into the random graph for any k≥3 and any fixed average degree d=np>dk. This generalises prior results on, e.g., the internal structure of the k-core.
Sign-in/Register to access full text options 
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.
