On the maximum number of edges in quasi-planar graphs

A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7n-O(1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5n-O(1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.

[1]  János Pach,et al.  Graphs drawn with few crossings per edge , 1996, GD.

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

[3]  Gábor Tardos,et al.  Crossing Stars in Topological Graphs , 2007, SIAM J. Discret. Math..

[4]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[5]  Micha Sharir,et al.  Topological Graphs with No Large Grids , 2005, Graphs Comb..

[6]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[7]  Eyal Ackerman,et al.  On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges , 2006, SCG '06.

[8]  Vasilis Capoyleas,et al.  A turán-type theorem on chords of a convex polygon , 1992, J. Comb. Theory, Ser. B.

[9]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[10]  János Pach,et al.  A generalization of quasi-planarity , 2004 .

[11]  Oswin Aichholzer,et al.  The point set order type data base: A collection of applications and results , 2001, CCCG.

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

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

[14]  János Pach.  Geometric Graph Theory , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[15]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

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