✦ LIBER ✦

A problem on arcs without bypasses in tournaments

✍ Scribed by J.W Moon

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 223 KB
Volume: 21
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90029-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extreme problem concerning k-arc-cycl

An extreme problem concerning k-arc-cyclic property for a class of tournaments

✍ Yongjin Zhu; Chuanping Chen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 623 KB

B. Alspach has proved that a regular tournament is arc-pancyclic. Zhu and Tian proved that if a tournament T = (V, A) with vertex set V, arc set A and order p satisfies that for any arc (vi, u,) of T, if df(uj) + d-(vi) \*p -2, then T is arc-pancyclic, where p >7. In this paper we study an extreme p

On the maximum cardinality of a consiste

On the maximum cardinality of a consistent set of arcs in a random tournament

✍ W Fernandez de la Vega 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 170 KB

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.

The number of pancyclic arcs in a k-stro

The number of pancyclic arcs in a k-strong tournament

✍ Anders Yeo 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

## Abstract A __tournament__ is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is __pancyclic__ in a digraph __D__, if it belongs to a cycle of length __l__, for all 3 ≤ __l__ ≤ |__V__ (__D__) |. Let __p__(__D__) denote the number of pancyclic arcs in a

Complementary cycles containing a fixed

Complementary cycles containing a fixed arc in diregular bipartite tournaments

✍ Ke Min Zhang; Yannis Manoussakis; Zeng Min Song 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Let (x, y) be a specified arc in a k-regular bipartite tournament B. We prove that there exists a cycle C of length four through (x, y) in B such that B-C is hamiltonian.

On Ramsey-Turán type problems in tournam

On Ramsey-Turán type problems in tournaments

✍ A Bialostocki; N Sauer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Let Tbe a tournament and let c :e(T)--> {1 ..... r} be an r-colouring of the edges of T. The associated reachability graph, denoted by R(T, c) is a directed graph whose vertices are the vertices of T, and a vertex v of R(T, c) dominates a vertex u of R(T, c) iff there is a monochromatic directed pat