Counting orientations of random graphs with no directed k-cycles

Marcelo Campos, Maurício Collares, Guilherme Oliveira Mota

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 le…