Quasirandom forcing orientations of cycles

Andrzej Grzesik, Daniel Il'kovič, Bartłomiej Kielak +1

An oriented graph $H$ is quasirandom-forcing if the limit (homomorphism) density of $H$ in a sequence of tournaments is $2^{-\Vert H\Vert }$ if and only if the sequence is quasirandom. We…