Abstract

The crossing number cr(G) of a graph G is the minimum possible number of edge crossings in a drawing of G in the plane, while the pair-crossing number pcr(G) is the smallest number of pairs of edges that cross in a drawing of G in the plane. While cr(G)pcr(G) holds trivially, it is not known whether a strict inequality can ever occur (this question was raised by Mohar and Pach and Tóth). We aim at bounding cr(G) in terms of pcr(G). Using the methods of Leighton and Rao, Bhatt and Leighton, and Even, Guha and Schieber, we prove that cr(G)=O(log³ n(pcr(G)+ssqd(G))), where n=|V(G)| and ssqd(G)=∑_vV(G) deg_G(v)². One of the main steps is an analogy of the well-known lower bound cr(G)=Ω(b(G)²)−O(ssqd(G)), where b(G) is the bisection width of G, that is, the smallest number of edges that have to be removed so that no component of the resulting graph has more than vertices. We show that pcr(G)=Ω(b(G)²/log² n)−O(ssqd(G)).

We also prove by similar methods that a graph G with crossing number

Full-size image

Author Keywords: Graph drawing; Crossing number; Pair-crossing number; Expansion

Article Outline

• References