|
|||||
|
|
Trees in tournaments |
|
| Authors: | Roland Häggkvist Andrew Thomason |
| Institution: | (1) University of Stockholm, Stockholm, Sweden;(2) University of Cambridge, Cambridge, UK |
| Abstract: | Letf(n) be the smallest integer such that every tournament of orderf(n) contains every oriented tree of ordern. Sumner has just conjectures thatf(n)=2n–2, and F. K. Chung has shown thatf(n) (1+o(1))nlog2
n. Here we show thatf(n)12n andf(n)(4+o(1))n. |
| Keywords: | 05 C 20 05 C 35 |
| 本文献已被 SpringerLink 等数据库收录！ | |