Directed Simplices In Higher Order Tournaments

Imre Leader, Ta Sheng Tan

It is well known that a tournament (complete oriented graph) on $n$ vertices has at most $1/4\left(\genfrac{}{}{0ex}{}{n}{3}\right)$ directed triangles, and that the constant 1/4 is best possible. Motivat…