On the maximum number of cliques in a graph (Q995772)

From MaRDI portal
Revision as of 14:09, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the maximum number of cliques in a graph
scientific article

    Statements

    title
    On the maximum number of cliques in a graph (English)
    0 references
    author
    David R. Wood
    0 references
    publication date
    10 September 2007
    0 references
    zbMATH Keywords
    extremal graph theory
    0 references
    Turán's theorem
    0 references
    clique
    0 references
    complete subgraph
    0 references
    degeneracy
    0 references
    graph minor
    0 references
    planar graph
    0 references
    cites work
    Q4871771
    0 references
    Q5724802
    0 references
    On cliques in graphs
    0 references
    Q3976610
    0 references
    Q5284028
    0 references
    Q3874233
    0 references
    Q4159089
    0 references
    Q3333070
    0 references
    Q4106232
    0 references
    Q3669452
    0 references
    On cliques in graphs
    0 references
    Q4953537
    0 references
    Q2716676
    0 references
    Q3576658
    0 references
    Q5689007
    0 references
    Ramsey-Turán theory
    0 references
    On cliques in graphs
    0 references

    Identifiers

    zbMATH DE Number
    5189140
    0 references
    OpenAlex ID
    W3124913715
    0 references
    arXiv ID
    math/0602191
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q995772&oldid=34988847"
    Powered by MediaWiki