36 search results - page 8 / 8 » On the Chromatic Thresholds of Hypergraphs |
APPROX
2011
Springer
12 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...