The k-core and branching processes
The k-core of a graph G is the maximal subgraph of G having minimum degree at least k. In 1996, Pittel, Spencer and Wormald found the threshold $\lambda_c$ for the emergence of a non-trivial k-core in the random graph $G(n,\lambda/n)$, and the asymptotic size of the k-core above the threshold. We gi...
| Yazar: | |
|---|---|
| Materyal Türü: | Journal article |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
2005
|