5-regular graphs are 3-colorable with positive probability

J. Díaz; G. Grammatikopoulos; A. C. Kaporis; L. M. Kirousis; X. Pérez; D. G. Sotiropoulos

Conference Proceedings

5-regular graphs are 3-colorable with positive probability

Díaz J
Grammatikopoulos G
Kaporis A
et al.

Lecture Notes in Computer Science (2005) 3669 215-225

DOI: 10.1007/11561071_21

3Citations

8Readers

Get full text

Abstract

We show that uniformly random 5-regular graphs of n vertices are 3-colorable with probability that is positive independently of n. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Díaz, J., Grammatikopoulos, G., Kaporis, A. C., Kirousis, L. M., Pérez, X., & Sotiropoulos, D. G. (2005). 5-regular graphs are 3-colorable with positive probability. In Lecture Notes in Computer Science (Vol. 3669, pp. 215–225). Springer Verlag. https://doi.org/10.1007/11561071_21

5-regular graphs are 3-colorable with positive probability

Abstract

Cite

Register to see more suggestions