Kolmogorov random graphs only have trivial stable colorings. (Q1603512): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov Random Graphs and the Incompressibility Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration by degree sequence of graphs of high degree / rank
 
Normal rank

Latest revision as of 11:48, 4 June 2024

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