共 50 条
Endpoint extendable paths in tournaments
被引:0
|作者:
Faudree, RJ
[1
]
Gyarfas, A
[1
]
机构:
[1] HUNGARIAN ACAD SCI,INST COMP & AUTOMAT,H-1111 BUDAPEST,HUNGARY
关键词:
D O I:
10.1002/(SICI)1097-0118(199611)23:3<303::AID-JGT10>3.0.CO;2-F
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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. (C) 1996 John Wiley & Sons, Inc.
引用
收藏
页码:303 / 307
页数:5
相关论文