Kolmogorov random graphs only have trivial stable colorings

Authors:
Qi Cheng;Fang Fang
Affiliations:
Department of Computer Science, University of Southern California, Los Angeles, CA;Environmental Systems Research Institute, Inc., Redlands, CA
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 0

Asymptotic enumeration by degree sequence of graphs of high degree

European Journal of Combinatorics
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
Automorphism groups, isomorphism, reconstruction

Handbook of combinatorics (vol. 2)
Kolmogorov Random Graphs and the Incompressibility Method

SIAM Journal on Computing
Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we prove that random graphs only have trivial stable colorings. Our result improves Theorem 4.1 in [Proc. 20th IEEE Symp. on Foundations of Comput. Sci., 1979, pp. 39-46]. It can be viewed as an effective version of Corollary 2.13 in [SIAM J. Comput. 29 (2) (2000) 590-599]. As a byproduct, we also give an upper bound of the size of induced regular subgraphs in random graphs.