Sciweavers

STOC
1994
ACM
125views Algorithms» more  STOC 1994»
13 years 9 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
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 ev...
Noga Alon, Nabil Kahale