On the Maximum Number of Cyclic Triples in Oriented Graphs

The maximum number of cyclic triples in an oriented graph of a given order is well known, being realized by the regular and near-regular tournaments. We consider the corresponding problem of determining the maximum number of cyclic triples in an oriented graph with a given number of arcs. A formula is found provided that the number of vertices is not too small relative to the number of arcs.