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.