On the maximum number of five-cycles in a triangle-free graph (Q713972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hypergraphs Do Jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank

Latest revision as of 19:41, 5 July 2024

scientific article
Language Label Description Also known as
English
On the maximum number of five-cycles in a triangle-free graph
scientific article

    Statements

    On the maximum number of five-cycles in a triangle-free graph (English)
    0 references
    0 references
    19 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Erdős conjecture
    0 references
    flag algebras
    0 references
    pentagon
    0 references
    triangle-free
    0 references
    Turán density
    0 references
    0 references
    0 references