Intersections of Oriented Graphs and Tournaments

Given two tournaments of order $n$, Bollobás and Scott defined their discrepancy as the largest deviation of their overlap from its random average under relabelling, and they asked whether the resulting discrepancy is always $Ω(n^{3/2})$. We answer this question by proving that there is an absolute