The maximum number of triangles in a \(K_4\)-free graph (Q1297475)

From MaRDI portal
Revision as of 11:00, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The maximum number of triangles in a \(K_4\)-free graph
scientific article

    Statements

    title
    The maximum number of triangles in a \(K_4\)-free graph (English)
    0 references
    author
    Jürgen Eckhoff
    0 references
    publication date
    4 April 2000
    0 references
    zbMATH Keywords
    clique number
    0 references
    Turán graph
    0 references
    \(K_4\)-free graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C35
    0 references
    05C30
    0 references
    05C69
    0 references
    zbMATH DE Number
    1321840
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1297475&oldid=13407876"
    Powered by MediaWiki