Minimum clique-free subgraphs of Kneser graphs (Q2243816)

From MaRDI portal
Revision as of 02:38, 2 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
Minimum clique-free subgraphs of Kneser graphs
scientific article

    Statements

    Minimum clique-free subgraphs of Kneser graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2021
    0 references
    Kneser graphs
    0 references
    saturation number
    0 references
    weak saturation number
    0 references

    Identifiers