END-POINT EXTENDIBLE PATHS IN TOURNAMENTS

Citation
Rj. Faudree et A. Gyarfas, END-POINT EXTENDIBLE PATHS IN TOURNAMENTS, Journal of graph theory, 23(3), 1996, pp. 303-307
Citations number
9
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
03649024
Volume
23
Issue
3
Year of publication
1996
Pages
303 - 307
Database
ISI
SICI code
0364-9024(1996)23:3<303:EEPIT>2.0.ZU;2-R
Abstract
Let s(n) be the threshold for which each directed path of order smalle r than s(n) is extendible from one of its endpoints in some tournament T-n. 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. (C) 1996 John Wiley & Sons, Inc.