Directed triple systems

Directed triple systems are an example of block designs on directed graphs. A block design on a directed graph can be defined as follows. Let G be a directed graph of k vertices which contain no loops. Let S be a set of υ elements. A collection of k-subsets of S with an assignment of the elements of each k-subset to the vertices of G is called a block design on G of order υ if the following is satisfied. Any ordered pair of elements of S is assigned λ times to an edge of G.For example, if S = {a, b, c, d, e} and

and bae; cad; abc; dbe; acd; bce; adb; cde; aed; bec; is a collection of 3-subsets so written that in each subset the first element is assigned to the vertex 1, the second to 2, and the third to 3, then the collection is a block design on G with λ = 1.In this paper, it is shown that for the graph

if λ = 1, then the graph exists for all υ such that ν ? 2 mod 3.