Cutting a Graph into Small Components

Abstract

For some fixed $n_0\ge 0$, we study the minimum number of vertices or edges that have to be removed from a graph such that no component of the rest has more than $n_0$ vertices.