Counting $$C_k$$-free Orientations of G(n, p)

We determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph G(n, p) containing no directed cycle of length k for every \(k\geqslant 3\). This solves a conjecture of Kohayakawa, Morris and the last two authors.