✦ LIBER ✦

The number of edge-disjoint transitive triples in a tournament

✍ Scribed by Raphael Yuster

Book ID: 108113473
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 170 KB
Volume: 287
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.07.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum number of arc-disjoint arbor

The maximum number of arc-disjoint arborescences in a tournament

✍ Ma Chung-fan; Cai Mao-cheng 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 2 views

## Abstract In this article, we give the maximum number of arc‐disjoint arborescences in a tournament or an oriented complete __r__‐partite graph by means of the indegrees of its vertices.

On the Maximal Number of Edges in Graphs

On the Maximal Number of Edges in Graphs with a Given Number of Edge-Disjoint Triangles

✍ Sauer, N. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 98 KB

A theorem on the maximum number of disjo

A theorem on the maximum number of disjoint steiner triple systems

✍ Alexander Rosa 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 389 KB

On the number of edge disjoint cliques i

On the number of edge disjoint cliques in graphs of given size

✍ Ervin Győri 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 592 KB

A completion of the spectrum for large s

A completion of the spectrum for large sets of disjoint transitive triple systems

✍ Qingde Kang; Yanxun Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 360 KB

The number of kings in a multipartite to

The number of kings in a multipartite tournament

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 401 KB

We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted).