Graphs drawn with few crossings per edge

We show that if a graph ofv vertices can be drawn in the plane so that every edge crosses at mostk>0 others, then its number of edges cannot exceed 4.108√kv. Fork≤4, we establish a better bound, (k+3)(v−2), which is tight fork=1 and 2. We apply these estimates to improve a result of Ajtai et al. and Leighton, providing a general lower bound for the crossing number of a graph in terms of its number of vertices and edges.

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

[2]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

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

[4]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[5]  Micha Sharir,et al.  On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.

[6]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

[7]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[8]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

[9]  László A. Székely,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.