A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one pdint in common: an endpoint or a point at which they properly cross. We say that two edges are disjoint if they do not intersect. We show that every simple complete monotone cylindrical graph on n vertices contains Omega (n(1-epsilon)) pairwise disjoint edges for any epsilon > 0. As a consequence, we show that every simple complete topological graph (drawn in the plane) With n vertices contains Omega(n(1/2-epsilon)) pairwise disjoint edges for any epsilon > 0. This improves the previous lower bound of Omega(n(1/3)) by Suk which was reproved by Fulek and Ruiz-Vargas. We remark that our proof implies a polynomial time algorithm for finding this set of pairwise disjoint edges. (C) 2016 Elsevier B.V. All rights reserved.