# Tag Info

Accepted

### Hardness of Maximum Independent Set in 3-Colorable Graphs

As detailed below, the problem of finding an independent set of size $\Omega(n^{1-\delta})$ in 3-colorable graphs is essentially equivalent to $O(n^\delta)$-approximating 3-COLOR. Currently, the best ...
• 9,024