Update complete graphs 202f26621cf34604935433a41b130f10.md

notion_data/Benchmark datasets 64e0439269f9497799025562a4087ce1/complete graphs 202f26621cf34604935433a41b130f10.md

@@ -51,4 +51,3 @@ For these graphs, we observe that when $n$ was odd, every scheme combination was
 
 > The crossing number of the complete bipartite graph $K_{n_1,n_2}$ is conjectured (e.g. see Zarankiewicz [35]) to be equal to $Z(n_1, n_2) := \left\lfloor n_1/2\right\rfloor \left\lfloor (n_1 − 1)/2\right\rfloor \left\lfloor n_2/2\right\rfloor \left\lfloor (n_2 − 1)/2\right\rfloor$.
 We ran the graphs $K_{n_1,n_2}$ for $5 ≤ n1 ≤ n2 ≤ 40$. Each graph was run with 100 random permutations and the minimum found solution was compared to $Z(n_1,n_2)$… As can be seen in Table 6, QuickCross was successful in obtaining the conjectured optimum in all cases and for all scheme combinations, except $K_{30,30}$ and $K_{40,40}$
->