Trees in tournaments


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.

This is a preview of subscription content, access via your institution.


  1. [1]

    K. B. Reid, andN. C. Wormald: Embedding orientedn-trees in tournaments,Studia Sci. Math. Hungar. 18 (1983), 377–387.

    Google Scholar 

  2. [2]

    A. G. Thomason: Paths and cycles in tournaments,Trans. Amer. Math. Soc. 296 (1986), 167–180.

    Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Häggkvist, R., Thomason, A. Trees in tournaments. Combinatorica 11, 123–130 (1991).

Download citation

AMS subject classification (1980)

  • 05 C 20
  • 05 C 35