Largest digraphs contained in all n-tournaments (Q788740)

From MaRDI portal
Revision as of 11:04, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Largest digraphs contained in all n-tournaments
scientific article

    Statements

    Largest digraphs contained in all n-tournaments (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    Let f(n) denote the largest integer such that there exists a directed graph D with n vertices and f(n) edges that is contained in every tournament with n vertices. The authors show, among other things, that \(c_ 1n\leq n \log_ 2n-f(n)\leq c_ 2n \log \log n\) for suitable constants \(c_ 1\) and \(c_ 2\).
    0 references
    0 references
    subgraphs
    0 references
    tournament
    0 references

    Identifiers