Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number

Achintya Raya Polavarapu

For integers $k\ge 1$ and $m\ge 2$, let $g(k,m)$ be the least integer $n\ge 1$ such that every graph with chromatic number at least $n$ contains a $(k+1)$-connected subgraph with c…