The maximum number of triangles in a \(K_4\)-free graph (Q1297475): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Rademacher-Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Triangles Contained in Certain Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of triangles in a \(K_ 4\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadows of colored complexes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les relations symétriques dans l'ensemble fini / rank
 
Normal rank

Latest revision as of 20:33, 28 May 2024

scientific article
Language Label Description Also known as
English
The maximum number of triangles in a \(K_4\)-free graph
scientific article

    Statements

    The maximum number of triangles in a \(K_4\)-free graph (English)
    0 references
    0 references
    4 April 2000
    0 references
    clique number
    0 references
    Turán graph
    0 references
    \(K_4\)-free graphs
    0 references

    Identifiers