Many disjoint edges in topological graphs

TL;DR

The paper proves that large complete topological graphs contain many pairwise disjoint edges, improving previous bounds and providing a polynomial time algorithm to find such edges.

Contribution

It establishes a new lower bound on the number of disjoint edges in complete topological graphs and introduces an efficient algorithm for identifying them.

Findings

Every simple complete monotone cylindrical graph on n vertices has (n^{1-\u03b5}) disjoint edges.

Every simple complete topological graph in the plane has (n^{1/2-\u03b5}) disjoint edges.

The proof yields a polynomial time algorithm for finding these disjoint edges.

Abstract

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 point 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^{\frac 12-\epsilon})$ pairwise disjoint edges for any $\epsilon>0$. This improves the previous lower bound of $\Omega(n^\frac 13)$ 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.