Figure 2 | Scientific Reports

Figure 2

From: Hard optimization problems have soft edges

Figure 2

Maximum size of a clique in G(N, 0.5) as function of the order of the graph. In green are presented \(K_{\text {max}}\), result of solving (2) and R(N) given by (3), respectively. In black is plotted the value of \(2 \log _2 N\) and in blue, \(\log _2 N\).

Back to article page