Endpoint Extendable Paths in Tournaments

Ralph J. Faudree, András Gyárfás

Research output: Contribution to journalArticle

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)303-307
Number of pages5
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - Nov 1996


ASJC Scopus subject areas

  • Geometry and Topology

Cite this