We investigate bounds on the dichromatic number of digraphs which avoid a fixed digraph as topological minor. For F , denote by mader ? ? ( ) smallest integer k such that every -dichromatic contains subdivision . As our first main result, we prove if is an orientation cycle then = v This settles conjecture Aboulker, Cohen, Havet, Lochet, Moura and Thomassé. also extend this result to more gener...