Premium
Superpure digraph designs
Author(s) -
Hartmann Sven
Publication year - 2002
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.10013
Subject(s) - digraph , combinatorics , mathematics , decomposition , discrete mathematics , ecology , biology
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 directed 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 is a variation of an earlier result of Lamken and Wilson J Combin Theory Ser A 89: 149–200, 2000. As an immediate consequence, we obtain new results for supersimple designs and pure perfect Mendelsohn designs. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 239–255, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10013