On the robustness of random k-cores

Cristiane M. Sato

The k-core of a graph is its maximal subgraph with minimum degree at least k. In this paper, we address robustness questions about k-cores. Given a k-core, remove one edge uniforml…