## Graphs Drawn with Few Crossings per Edge
Pach, János and Tóth, Géza
(1997)
Full text not available from this repository. ## AbstractWe show that if a graph of v vertices can be drawn in the plane so that every edge crosses at most k>0 others, then its number of edges cannot exceed 4.108 \sqrt{kv}. For k<=4, we establish a better bound, (k+3)(v-2), which is tight for k=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 naumber of a graph in terms of its number of vertices and edges.
Repository Staff Only: item control page References |