, Volume 17, Issue 3, pp 427-439

Graphs drawn with few crossings per edge

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Supported by NSF grant CCR-94-24398 and PSC-CUNY Research Award 667339.
Supported by OTKA-T-020914, OTKA-F-22234 and the Margaret and Herman Sokol Postdoctoral Fellowship Award.