Extremal digraphs avoiding distinct walks of length 3 with the same endpoints (Q2144591)

From MaRDI portal
Revision as of 08:38, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
scientific article

    Statements

    Extremal digraphs avoiding distinct walks of length 3 with the same endpoints (English)
    0 references
    0 references
    0 references
    14 June 2022
    0 references
    digraph
    0 references
    Turán problem
    0 references
    walk
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references