## Abstract

Let G_{3n,p,3} be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes, and then choose every pair of vertices of distinct color classes, randomly and independently, to be edges with probability p. We describe a polynomial-time algorithm that finds a proper 3-coloring of G_{3n,p,3} with high probability, whenever p ≥ c/n, where c is a sufficiently large absolute constant. This settles a problem of Blum and Spencer, who asked if an algorithm can be designed that works almost surely for p ≥ polylog(n)/n [J. Algorithms, 19 (1995), pp. 204-234]. The algorithm can be extended to produce optimal k-colorings of random k-colorable graphs in a similar model as well as in various related models. Implementation results show that the algorithm performs very well in practice even for moderate values of c.

Original language | English (US) |
---|---|

Pages (from-to) | 1733-1748 |

Number of pages | 16 |

Journal | SIAM Journal on Computing |

Volume | 26 |

Issue number | 6 |

DOIs | |

State | Published - Dec 1997 |

## All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Mathematics(all)

## Keywords

- Algorithms
- Graph coloring
- Graph eigenvalues
- Random graphs