Directed triangles in directed graphs (Q5905662)

From MaRDI portal
Revision as of 00:55, 27 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127846301, #quickstatements; #temporary_batch_1721950759712)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 166372
Language Label Description Also known as
English
Directed triangles in directed graphs
scientific article; zbMATH DE number 166372

    Statements

    Directed triangles in directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    The authors show that if each vertex of an oriented graph \(G_ n\) has indegree and outdegree at least \(n/t\), where \(t=2.867\dots,\) then \(G_ n\) contains an oriented 3-cycle.
    0 references
    0 references
    triangles
    0 references
    oriented graph
    0 references
    indegree
    0 references
    outdegree
    0 references
    3-cycle
    0 references
    0 references
    0 references
    0 references