Directed Simplices In Higher Order Tournaments

Abstract

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. Motivated by some geometric considerations, our aim in this paper is to consider some `higher order' versions of this statement. For example, if we give each 3-set from an $n$-set a cyclic ordering, then what is the greatest number of `directed 4-sets' we can have? We give an asymptotically best possible answer to this question, and give bounds in the general case when we orient each $d$-set from an $n$-set.

9 pages

Cited by in corpus (2)

• On a generalisation of Mantel's theorem to uniformly dense hypergraphs
• On high-dimensional acyclic tournaments