Efficient coloring of a large spectrum of graphs
DAC '98 Proceedings of the 35th annual Design Automation Conference
| Hi-index | 0.00 |
We demonstrate in this paper a very simple method for ``hiding'''' large cliques in random graphs. While the largest clique in a random graph is very likely to be of size about $2 \log_2{n}$, it is widely conjectured that no polynomial-time algorithm exists which finds a clique of size $(1 + \epsilon)\log_2{n}$ with significant probability for any constant $\epsilon