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 Tn. 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.
|Number of pages||5|
|Journal||Journal of Graph Theory|
|Publication status||Published - Nov 1996|
ASJC Scopus subject areas
- Geometry and Topology