Subdivisions of graphs with large minimum degree

We prove a theorem on path systems implying the conjecture of Bollobás that there exists a function f(k, m) (where k and m are natural numbers) satisfying the following: For each graph G of minimum degree at least f(k, m) there exists a graph H of minimum degree at least k such that G contains the graph obtained from H by subdividing each edge m times.