We prove that every graph of minimum degree at least r and girth at least 27 contains a subdivision of Kr+1. This implies that the conjecture of Hajos, that every graph of chromatic number at least r contains a subdivision of K-r, is true for graphs of girth at least 27. This conjecture is known to be false in general.
- Hajos conjecture
- topological minors