Sven Hartmann
Superpure digraph designs
Preprint series: Preprints aus dem Fachbereich Mathematik, Universität Rostock
05C70 Factorization, matching, covering and packing
05B30 Other designs, configurations, See also {51E30}
Abstract: A digraph design is a decomposition of a complete (symmetric) digraph into
copies of pre-specified digraphs. Well-known examples for digraph designs
are Mendelsohn designs, directed designs or orthogonal double covers.
A digraph design is superpure if any two of the subdigraphs in the
decomposition have no more than two vertices in common. We give an
asymptotic existence theorem for superpure digraph designs, which
generalizes an earlier result of Lamken and Wilson. As an immediate
consequence, we obtain new results for supersimple designs and pure
perfect Mendelsohn designs.

Keywords: decomposition, digraph design, pure design, Mendelsohn design