On unavoidability of trees with \(k\) leaves (Q1396655): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-002-0483-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990037810 / rank
 
Normal rank

Latest revision as of 01:26, 20 March 2024

scientific article
Language Label Description Also known as
English
On unavoidability of trees with \(k\) leaves
scientific article

    Statements

    On unavoidability of trees with \(k\) leaves (English)
    0 references
    8 July 2003
    0 references
    Let \(g(k)\) denote the least integer such that every oriented tree with \(n\) vertices and \(k\) leaves is contained in every tournament with \(n+g(k)\) vertices. The author and S. Thomassé have conjectured that \(g(k) \leq k-1\); see [Discrete Math. 243, 121-134 (2002; Zbl 0995.05037)]. In the present paper the author proves this conjecture for a certain restricted family of oriented trees that he calls constructible.
    0 references
    oriented tree
    0 references
    tournament
    0 references
    0 references
    0 references

    Identifiers