论文信息 - On the Number of Edges of Fan-Crossing Free Graphs

On the Number of Edges of Fan-Crossing Free Graphs

A graph drawn in the plane with n vertices is fan-crossing free if there is no triple of edges e,f and g, such that e and f have a common endpoint and g crosses both e and f. We prove a tight bound of 4n − 9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4n − 8 if the edges are Jordan curves. We also discuss generalizations to monotone graph properties.

Otfried Cheong | Hyo-Sil Kim | Sariel Har-Peled | Heuna Kim

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

[2] Walter Didimo. Density of straight-line 1-planar graph drawings , 2013, Inf. Process. Lett..

[3] János Pach,et al. The Number of Edges in k-Quasi-planar Graphs , 2011, SIAM J. Discret. Math..

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

[5] Walter Didimo,et al. Drawing Graphs with Right Angle Crossings , 2009, WADS.

[6] Farhad Shahrokhi,et al. Applications of the crossing number , 2005, Algorithmica.

[7] Vladimir P. Korzhik,et al. Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing , 2013, J. Graph Theory.

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

[9] Giuseppe Liotta,et al. Right angle crossing graphs and 1-planarity , 2013, Discret. Appl. Math..

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

[11] Michael A. Bekos,et al. The Straight-Line RAC Drawing Problem is NP-Hard , 2010, J. Graph Algorithms Appl..

[12] Giuseppe Liotta,et al. Fáry's Theorem for 1-Planar Graphs , 2012, COCOON.

[13] Eyal Ackerman. On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges , 2009, Discret. Comput. Geom..