Maximum cliques in a graph without disjoint given subgraph (Q6117354)

From MaRDI portal
Revision as of 18:36, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7806392
Language Label Description Also known as
English
Maximum cliques in a graph without disjoint given subgraph
scientific article; zbMATH DE number 7806392

    Statements

    Maximum cliques in a graph without disjoint given subgraph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2024
    0 references
    generalized Turán number
    0 references
    disjoint union
    0 references
    extremal graph
    0 references

    Identifiers