A communication problem and directed triple systems

被引：4

作者：

Gyarfas, A

Schelp, RH ^{[1
]}

机构：

[1] Memphis State Univ, Dept Math Sci, Memphis, TN 38152 USA

[2] Hungarian Acad Sci, Comp & Automat Res Inst, Budapest, Hungary

来源：

DISCRETE APPLIED MATHEMATICS | 1998年 / 85卷 / 02期

基金：

美国国家科学基金会; 匈牙利科学研究基金会;

关键词：

networks; transitive triples; complete symmetric digraph; pairable graph;

D O I：

10.1016/S0166-218X(98)00028-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：139 / 147

页数：9