Kolmogorov random graphs only have trivial stable colorings.
From MaRDI portal
Publication:1603512
DOI10.1016/S0020-0190(01)00206-XzbMath1050.68051MaRDI QIDQ1603512
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Cites Work