✦ LIBER ✦

Weakening arcs in tournaments

✍ Scribed by Denis Hanson; John W. Moon

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 155 KB
Volume: 45
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10148

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A weakening arc of an irreducible tournament is an arc whose reversal creates a reducible tournament. We consider properties of such arcs and derive recurrence relations for enumerating strong tournaments with no such arcs, one or more such arcs, and exactly one such arc. We also give some asymptotic results on the numbers of such tournaments, among other things. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 142–162, 2004

📜 SIMILAR VOLUMES

Pancyclic arcs and connectivity in tourn

Pancyclic arcs and connectivity in tournaments

✍ F. Havet 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract A __tournament__ is an orientation of the edges of a complete graph. An arc is __pancyclic__ in a tournament __T__ if it is contained in a cycle of length __l__, for every 3 ≤ __l__ ≤ |T|. Let __p__(__T__) denote the number of pancyclic arcs in a tournament __T__. In 4, Moon showed that

A problem on arcs without bypasses in to

A problem on arcs without bypasses in tournaments

✍ J.W Moon 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 223 KB

On arc-traceable tournaments

✍ Arthur H. Busch; Michael S. Jacobson; K. B. Reid 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A digraph __D__ = (__V__, __A__) is arc‐traceable if for each arc __xy__ in __A__, __xy__ lies on a directed path containing all the vertices of __V__, that is, a hamiltonian path. Given a tournament __T__, it is well known that it contains a directed hamiltonian path. In this article,

Spanning k-arc-strong subdigraphs with f

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments

✍ Jørgen Bang-Jensen; Jing Huang; Anders Yeo 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract Given a __k__‐arc‐strong tournament __T__, we estimate the minimum number of arcs possible in a __k__‐arc‐strong spanning subdigraph of __T__. We give a construction which shows that for each __k__ ≥ 2, there are tournaments __T__ on __n__ vertices such that every __k__‐arc‐strong spann

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