Largest digraphs contained in all n-tournaments (Q788740): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Realization of certain generalized paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity of paths and circuits in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antidirected Hamiltonian circuits in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680857 / rank
 
Normal rank

Revision as of 10:50, 14 June 2024

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
    subgraphs
    0 references
    tournament
    0 references
    0 references

    Identifiers