Kolmogorov random graphs only have trivial stable colorings.
type: Item
instance of: scholarly article
title: Kolmogorov random graphs only have trivial stable colorings.
zbMATH Open document ID: 1050.68051
DOI: 10.1016/S0020-0190(01)00206-X
author: Qi Cheng
author: Fang Fang
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 1767417
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Regular graph
zbMATH Keywords: Graph automorphism
zbMATH Keywords: Kolmogorov complexity
MaRDI profile type: Publication
cites work: Q4871775
cites work: Kolmogorov Random Graphs and the Incompressibility Method
cites work: Q2739445
cites work: Asymmetric graphs
cites work: Q4023358
cites work: Asymptotic enumeration by degree sequence of graphs of high degree
description: scientific article; zbMATH DE number 1767417