Graph Drawings with no k Pairwise Crossing Edges

A geometric graph is a graph G = (V, E) drawn in the plane so that the vertex set V consists of points in general position and the edge set E consists of straight line segments between points of V. It is known that, for any fixed k, any geometric graph G on n vertices with no k pairwise crossing edges contains at most O(n log n) edges. In this paper we give a new, simpler proof of this bound, and show that the same bound holds also when the edges of G are represented by x-monotone curves (Jordan arcs).

[1]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[2]  János Pach,et al.  Combinatorial Geometry , 2012 .

[3]  János Pach.  Notes on Geometric Graph Theory , 1990, Discrete and Computational Geometry.

[4]  Farhad Shahrokhi,et al.  Applications of the crossing number , 1994, SCG '94.

[5]  Micha Sharir,et al.  Quasi-planar graphs have a linear number of edges , 1995, GD.

[6]  Pavel Valtr,et al.  On Geometric Graphs with No k Pairwise Parallel Edges , 1997, Discret. Comput. Geom..

[7]  Martin Klazar,et al.  Generalized Davenport-Schinzel sequences , 1994, Comb..

[8]  J. Pach,et al.  Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.

[9]  H. Davenport,et al.  A Combinatorial Problem Connected with Differential Equations , 1965 .

[10]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[11]  Martin Klazar,et al.  Generalized Davenport-Schinzel sequences with linear upper bound , 1992, Discret. Math..

[12]  János Pach,et al.  Some geometric applications of Dilworth’s theorem , 1994, Discret. Comput. Geom..