𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Autonomous parts and decomposition of regular tournaments

✍ Scribed by Annie Astié-Vidal; Vincent Dugat

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
591 KB
Volume
111
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Astit-Vidal, A. and V. Dugat, Autonomous parts and decomposition of regular tournaments, Discrete Mathematics 111 (1993) 27-36.

In this article we present the action of a decomposition criterion for regular tournaments, called W-decomposition on tournaments presenting autonomous parts, and especially those that are undecomposable with respect to W-decomposition.

📜 SIMILAR VOLUMES

On the decomposition of λK into regular
On the decomposition of λK into regular tournaments of order 5
✍ A. Mahmoodi; R. Mathon 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

## Abstract An RTD[5,λ; __v__] is a decomposition of the complete symmetric directed multigraph, denoted by λK, into regular tournaments of order 5. In this article we show that an RTD[5,λ; __v__] exists if and only if (__v__−1)λ ≡ 0 (mod 2) and __v__(__v__−1)λ ≡ 0 (mod 10), except for the impossib

Properties of regular systems and algori
Properties of regular systems and algorithmic improvements for regular decomposition
✍ Meng Jin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 861 KB

In this paper, we study the properties of regular systems and improve the efficiency of the regular decomposition method RegSer implemented in Epsilon. We define a weaker concept which retains most properties of regular system. It can be shown that from a weak regular system one can also define a re

Regular representations of finite groups
Regular representations of finite groups as automorphism groups of k-tournaments
✍ S. Marshall 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract It was shown by Babai and Imrich [2] that every finite group of odd order except $Z^2\_3$ and $Z^3\_3$ admits a regular representation as the automorphism group of a tournament. Here, we show that for __k__ ≥ 3, every finite group whose order is relatively prime to and strictly larger t

Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge