5-regular graphs are 3-colorable with positive probability

Authors:
J. Díaz;G. Grammatikopoulos;A. C. Kaporis;L. M. Kirousis;X. Pérez;D. G. Sotiropoulos
Affiliations:
Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Catalunya;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece;Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Catalunya;Department of Mathematics, University of Patras, Patras, Greece
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

A limited memory algorithm for bound constrained optimization

SIAM Journal on Scientific Computing
The Asymptotic Order of the Random k -SAT Threshold

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Almost all graphs with average degree 4 are 3-colorable

Journal of Computer and System Sciences - STOC 2002
The two possible values of the chromatic number of a random graph

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Hi-index	0.00

We show that uniformly random 5-regular graphs of n vertices are 3-colorable with probability that is positive independently of n.