𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number of Out-Pancyclic Vertices in a Strong Tournament

✍ Scribed by Qiaoping Guo, Shengjia Li, Hongwei Li, Huiling Zhao

Book ID
120788864
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
194 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The structure of 4-strong tournaments co
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices
✍ Qiaoping Guo; Shengjia Li; Ruijuan Li πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 200 KB πŸ‘ 2 views

## Abstract Yao et al. (Discrete Appl Math 99 (2000), 245–249) proved that every strong tournament contains a vertex __u__ such that every out‐arc of __u__ is pancyclic and conjectured that every __k__‐strong tournament contains __k__ such vertices. At present, it is known that this conjecture is t

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