A communication problem and directed triple systems Original Research Article

The solution of a specific network problem is shown to be equivalent to the decomposition of a certain complete symmetric digraph into edge disjoint balanced transitive triples. Further related decomposition results and conjectures are presented as well.