On oriented Turán problems

Dániel Gerbner, Xuanrui Hu, Yuefang Sun

The oriented Turán number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$…