论文信息 - On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges - 字舞流文

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

We show that the maximum number of edges in a topological graph on n vertices and with no four pairwise crossing edges is O(n).

Eyal Ackerman | Eyal Ackerman

[1] János Pach,et al. Relaxing Planarity for Topological Graphs , 2002, JCDCG.

[2] Gábor Tardos,et al. On the maximum number of edges in quasi-planar graphs , 2007, J. Comb. Theory, Ser. A.

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

[4] Pavel Valtr. Graph Drawings with no k Pairwise Crossing Edges , 1997, Graph Drawing.

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