Trees in tournaments

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1991 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 11, pages 123-130 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: Roland Häggkvist; Andrew Thomason 0001;

doi: 10.1007/bf01206356

Trees in tournaments

- Summary
- Subjects
- Metrics

Abstract

Let \(f(n)\) denote the least integer \(N\) such that every tournament with \(N\) nodes contains every oriented tree with \(n\) nodes. The authors show that \(f(n)\leq 12n\) and \(f(n)\leq(4+o(1))n\).

Related Organizations

University of Cambridge
United Kingdom
Stockholm University
Sweden

Keywords

Extremal problems in graph theory, oriented tree, Directed graphs (digraphs), tournaments, Trees, tournament

Impact byBIP!

	citations The total number of citations received by all articles of the researcher of interest.	26
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average