On the Number of 4-Cycles in a Tournament (Q2833121): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1619586052 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.1576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Profiles of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 3‐Local Profiles of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cliques in graphs of given order and size / rank
 
Normal rank

Latest revision as of 22:48, 12 July 2024

scientific article
Language Label Description Also known as
English
On the Number of 4-Cycles in a Tournament
scientific article

    Statements

    On the Number of 4-Cycles in a Tournament (English)
    0 references
    0 references
    0 references
    16 November 2016
    0 references
    local graph theory
    0 references
    tournaments
    0 references
    extremal combinatorics
    0 references
    small cycles in tournaments
    0 references

    Identifiers

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