48 citations · 110 across the 37 of their papers we have counts for
4 papers · 1 filter
The number of edges in k-quasi-planar graphs
Jacob Fox, Janos Pach, Andrew Suk
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum nu…
Disjoint edges in complete topological graphs
Andrew Suk
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…
-quasi planar graphs
Andrew Suk
A topological graph is \emph{-quasi-planar} if it does not contain pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most…
Erdos-Szekeres-type theorems for monotone paths and convex bodies
Jacob Fox, Janos Pach, Benny Sudakov +1
For any sequence of positive integers j_1 < j_2 < ... < j_n, the k-tuples (j_i,j_{i + 1},...,j_{i + k-1}), i=1, 2,..., n - k+1, are said to form a monotone path of length n. Given…