Graph decompositions without isolated vertices (Q1892833)

The author proves the following conjecture of \textit{A. Frank} (Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975): Let \(G\) be a connected simple graph of order \(n\), and \(n= n_1+\cdots+ n_k\) be a partition of \(n\) with \(n\geq 2\). Suppose that the minimum degree of \(G\) is at least \(k\). Then the vertex set \(V(G)\) can be decomposed into disjoint subsets \(V_1,\dots, V_k\) so that \(|V_i|= n_i\) and the subgraph induced by \(V_i\) contains no isolated vertices for all \(i\), \(1\leq i\leq k\).