  It is shown that every complete n-vertex simple topological graph has at
least Omega(n^{1/3}) pairwise disjoint edges, and these edges can be found in
polynomial time. This proves a conjecture of Pach and T\'oth.
