Thomassen's orientation conjecture for highly connected graphs

A graph $G=(V,E)$ is $k$-connected if it remains connected after the deletion of any set of at most $k-1$ vertices. An orientation of $G$ is $k$-strong if its corresponding digraph remains strongly connected after the deletion of any set of at most $k-1$ vertices. Thomassen's conjecture. There exists an integer function $g(k)$ such that every $g(k)$-connected graph has a $k$-strong orientation. This conjecture was proved by Garamvölgyi, Jordan, Király and Villányi, who showed that one may take $g(k)320k^2$; it is therefore solved.