Trees in tournaments (Q5905439): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3950574 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths and Cycles in Tournaments / rank | |||
Normal rank | |||
Latest revision as of 14:01, 15 May 2024
scientific article; zbMATH DE number 25764
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trees in tournaments |
scientific article; zbMATH DE number 25764 |
Statements
Trees in tournaments (English)
0 references
27 June 1992
0 references
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\).
0 references
tournament
0 references
oriented tree
0 references
