Counting orientations of random graphs with no directed k-cycles

Abstract

For every $k\ge 3$, we determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph containing no directed cycle of length $k$. This solves a conjecture of Kohayakawa, Morris and the last two authors.

17 pages, minor changes