Decomposing a graph into subgraphs with small components

Rain Jiang, Kai Jiang, Minghui Jiang

The component size of a graph is the maximum number of edges in any connected component of the graph. Given a graph $G$ and two integers $k$ and $c$, $(k,c)$-Decomposition is the p…