@inproceedings{Fomin2020BuildingLK,
title={Building large k-cores from sparse graphs},
author={F. Fomin and Danil Sagunov and Kirill Simonov},
booktitle={MFCS},
year={2020}
}

A popular model to measure network stability is the $k$-core, that is the maximal induced subgraph in which every vertex has degree at least $k$. For example, $k$-cores are commonly used to model the unraveling phenomena in social networks. In this model, users having less than $k$ connections within the network leave it, so the remaining users form exactly the $k$-core. In this paper we study the question whether it is possible to make the network more robust by spending only a limited amount… Expand