We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of K_r+1 and that for r435 a girth of at least 15 suffices. This implies that the conjecture of Hajós that every graph of chromatic number at least r contains a subdivision of K_r (which is false in general) is true for graphs of girth at least 186 (or 15 if r436). More generally, we show that for every graph H of maximum degree Δ(H)2, every graph G of minimum degree at least {Δ(H),3} and girth at least contains a subdivision of H. This bound on the girth of G is best possible up to the value of the constant and improves a result of Mader, who gave a bound linear in H.