A minimum degree result for disjoint cycles and forests in graphs (Q1297728): Difference between revisions

Generalizing theorems of \textit{K. Corrádi} and \textit{A. Hajnal} [Acta Math. Acad. Sci. Hung. 14, 423-439 (1963; Zbl 0118.19001)] and \textit{S. Brandt} [J. Comb. Theory, Ser. B. 61, No. 1, 63-70 (1994; Zbl 0804.05024)], the author proves the following: Let \(F\) be a forest on \(s\) edges without isolated vertices and let \(G\) be a graph of order at least \(3k+| V(F)| \) with minimum degree at least \(2k+s\), where \(k\) and \(s\) are nonnegative integers. Then \(G\) contains the disjoint union of the forest \(F\) and \(k\) disjoint cycles.