A communication problem and directed triple systems

A. Gyárfás, R. H. Schelp

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)139-147
Number of pages9
JournalDiscrete Applied Mathematics
Volume85
Issue number2
Publication statusPublished - Jun 28 1998

Fingerprint

Triple System
Decomposition
Decompose
Communication
Digraph
Disjoint

Keywords

  • Complete symmetric digraph
  • Networks
  • Pairable graph
  • Transitive triples

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A communication problem and directed triple systems. / Gyárfás, A.; Schelp, R. H.

In: Discrete Applied Mathematics, Vol. 85, No. 2, 28.06.1998, p. 139-147.

Research output: Contribution to journalArticle

Gyárfás, A. ; Schelp, R. H. / A communication problem and directed triple systems. In: Discrete Applied Mathematics. 1998 ; Vol. 85, No. 2. pp. 139-147.
@article{cadec190351a48f1a500925173baffe3,
title = "A communication problem and directed triple systems",
abstract = "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.",
keywords = "Complete symmetric digraph, Networks, Pairable graph, Transitive triples",
author = "A. Gy{\'a}rf{\'a}s and Schelp, {R. H.}",
year = "1998",
month = "6",
day = "28",
language = "English",
volume = "85",
pages = "139--147",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - A communication problem and directed triple systems

AU - Gyárfás, A.

AU - Schelp, R. H.

PY - 1998/6/28

Y1 - 1998/6/28

N2 - 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.

AB - 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.

KW - Complete symmetric digraph

KW - Networks

KW - Pairable graph

KW - Transitive triples

UR - http://www.scopus.com/inward/record.url?scp=0041125910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041125910&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0041125910

VL - 85

SP - 139

EP - 147

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -