Sven Hartmann
Asymptotic results on suborthogonal \vec{\mathfrak{B}}-decompositions of complete digraphs
Preprint series: Preprints aus dem Fachbereich Mathematik, Universität Rostock
05C99 None of the above but in this section
Abstract: A \vec{\mathfrak{B}}-decomposition of a complete digraph \vec{\mathfrak{D}_n} is a
partition of \vec{\mathfrac{D}_n} into isomorphic copies (called pages) of \vec{\mathfrak{B}}. A
\vec{\mathfrak{B}}-decomposition is said to be suborthogonal if the union of any
two pages contain at most one pair of reverse arcs.
R.M. Wilson proved in 1975 that a \vec{\mathfrak{B}}-decomposition exists
for almost all integers n staisfying certain necessary conditions.
In this paper we shall prove that under the same conditions
there exists even a suborthogonal \vec{\mathfrak{B}}-decomposition.