There is no fast method for finding monochromatic complete subgraphs (Q1052332)

From MaRDI portal
Revision as of 15:41, 11 July 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
There is no fast method for finding monochromatic complete subgraphs
scientific article

    Statements

    There is no fast method for finding monochromatic complete subgraphs (English)
    0 references
    0 references
    1983
    0 references
    2-coloration
    0 references
    infinite complete graph
    0 references
    monochromatic complete subgraph
    0 references

    Identifiers