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

From MaRDI portal
Revision as of 03:39, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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