Asymptotic results on suborthogonal G→-decompositions of complete digraphs
نویسندگان
چکیده
منابع مشابه
Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs
A ~ G-decomposition of a complete digraph ~ D n is a partition of ~ D n into isomorphic copies (called pages) of ~ G. A ~ G-decomposition is said to be suborthogonal if the union of any two pages contains at most one pair of reverse arcs. R. M. Wilson 5] proved in 1975 that a ~ G-decomposition exists for almost all integers n satisfying certain necessary conditions. In this paper we shall prove...
متن کاملOrthogonal Decompositions of Complete Digraphs
A family G of isomorphic copies of a given digraph ~ G is said to be an orthogonal decomposition of the complete digraph ~ D n by ~ G, if every arc of ~ D n belongs to exactly two members of G and the union of any two diierent elements from G contains precisely one pair of reverse arcs. Given a digraph ~ H, an ~ H-family m ~ H is the vertex-disjoint union of m copies of ~ H. In this paper, we c...
متن کاملDecompositions of nearly complete digraphs into t isomorphic parts
An arc decomposition of the complete digraph DKn into t isomorphic subdigraphs is generalized to the case where the numerical divisibility condition is not satisfied. Two sets of nearly tth parts are constructively proved to be nonempty. These are the floor tth class (DKn − R)/t and the ceiling tth class (DKn + S)/t, where R and S comprise (possibly copies of) arcs whose number is the smallest ...
متن کاملSuborthogonal double covers of complete graphs
A family G of isomorphic copies of a given graph G is said to be a suborthogonal double cover (SODC) of the complete graph K n by G, if every edge of K n belongs to exactly two members of G and any two diierent elements from G share at most one edge. We introduce the notion of an SODC as a generalization of the well-known concept of orthogonal double covers. Our objective is to investigate the ...
متن کاملOn decompositions of complete hypergraphs
We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00083-9