Kolmogorov random graphs only have trivial stable colorings. (Q1603512)

From MaRDI portal
Revision as of 20:39, 23 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
Kolmogorov random graphs only have trivial stable colorings.
scientific article

    Statements

    Kolmogorov random graphs only have trivial stable colorings. (English)
    0 references
    0 references
    0 references
    14 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    Combinatorial problems
    0 references
    Regular graph
    0 references
    Graph automorphism
    0 references
    Kolmogorov complexity
    0 references