An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs

@article{Blum1997AnA,
title={An {\~O}(n^\{3/14\})-Coloring Algorithm for 3-Colorable Graphs},
author={Avrim Blum and David R. Karger},
journal={Inf. Process. Lett.},
year={1997},
volume={61},
pages={49-53}
}

We show how the results of Karger, Motwani, and Sudan 6] and Blum 3] can be combined in a natural manner to yield a polynomial-time algorithm for ~ O(n 3=14)-coloring any n-node 3-colorable graph. This improves on the previous best bound of ~ O(n 1=4) colors 6].