Skip to main content
SpringerLink
Log in

Trees in tournaments

  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Stockholm, Stockholm, Sweden

    Roland Häggkvist

  2. University of Cambridge, Cambridge, UK

    Andrew Thomason

Authors
  1. Roland Häggkvist
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Thomason
    View author publications

    You can also search for this author in PubMed Google Scholar

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). https://doi.org/10.1007/BF01206356

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206356

AMS subject classification (1980)

Search

Navigation