Premium
Endpoint extendable paths in tournaments
Author(s) -
Faudree Ralph J.,
Gyárfás András
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199611)23:3<303::aid-jgt10>3.0.co;2-f
Subject(s) - tournament , mathematics , combinatorics , path (computing) , term (time) , order (exchange) , discrete mathematics , computer science , physics , finance , quantum mechanics , economics , programming language
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 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 . © 1996 John Wiley & Sons, Inc.