Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

For each pair k, m of natural numbers there exists a natural number f(k, m) such that every f(k, m)-chromatic graph contains a k-connected subgraph of chromatic number at least m.