𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path numbers of tournaments

✍ Scribed by Brian Alspach; David W Mason; Norman J Pullman

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
379 KB
Volume
20
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Path-connectivity in local tournaments
Path-connectivity in local tournaments
✍ Yubao Guo πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 998 KB

A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize thos

Endpoint extendable paths in tournaments
Endpoint extendable paths in tournaments
✍ Faudree, Ralph J.; GyοΏ½rfοΏ½s, AndrοΏ½s πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 254 KB

Let s(n) be the threshold for which each directed path of order smaller than s ( n ) is extendible from one of its endpoints in some tournament T,. It is shown that s(n) is asymptotic to 3n/4, with an error term at most 3 for infinitely many n. There are six tournaments with s ( n ) = n.