The minimum number of clique-saturating edges (Q2680567)

From MaRDI portal
Revision as of 06:36, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The minimum number of clique-saturating edges
scientific article

    Statements

    The minimum number of clique-saturating edges (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2023
    0 references
    \(K_p\)-saturating
    0 references
    Turán graph
    0 references
    extremal graph
    0 references

    Identifiers