✦ LIBER ✦
Kolmogorov random graphs only have trivial stable colorings
✍ Scribed by Qi Cheng; Fang Fang
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 52 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we prove that random graphs only have trivial stable colorings. Our result improves Theorem 4.1 in [Proc.