Crossing number (graph theory)

A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3.

In graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is planar if and only if its crossing number is zero.

The mathematical origin of the study of crossing numbers is in Turán's brick factory problem, in which Pál Turán asked to determine the crossing number of the complete bipartite graph K_m,n. However, the same problem of minimizing crossings was also considered in sociology at approximately the same time as Turán, in connection with the construction of sociograms. It continues to be of great importance in graph drawing.

Without further qualification, the crossing number allows drawings in which the edges may be represented by arbitrary curves; the rectilinear crossing number requires all edges to be straight line segments, and may differ from the crossing number. In particular, the rectilinear crossing number of a complete graph is essentially the same as the minimum number of convex quadrilaterals determined by a set of n points in general position, closely related to the Happy Ending problem.

History

During World War II, Hungarian mathematician Pál Turán was forced to work in a brick factory, pushing wagon loads of bricks from kilns to storage sites. The factory had tracks from each kiln to each storage site, and the wagons were harder to push at the points where tracks crossed each other, from which Turán was led to ask his brick factory problem: what is the minimum possible number of crossings in a drawing of a complete bipartite graph?

Zarankiewicz attempted to solve Turán's brick factory problem; his proof contained an error, but he established a valid upper bound of

$cr(K_{m,n})\leq \left\lfloor {\frac {n}{2}}\right\rfloor \left\lfloor {\frac {n-1}{2}}\right\rfloor \left\lfloor {\frac {m}{2}}\right\rfloor \left\lfloor {\frac {m-1}{2}}\right\rfloor$

for the crossing number of the complete bipartite graph K_m,n. The conjecture that this inequality is actually an equality is now known as Zarankiewicz' crossing number conjecture. The gap in the proof of the lower bound was not discovered until eleven years after publication, nearly simultaneously by Gerhard Ringel and Paul Kainen; see

The problem of determining the crossing number of the complete graph was first posed by Anthony Hill, and appears in print in 1960. Hill and his collaborator John Ernest were two constructionist artists fascinated by mathematics, who not only formulated this problem but also originated a conjectural upper bound for this crossing number, which Richard K. Guy published in 1960., namely

$cr(K_{p})\leq (1/4)\left\lfloor {\frac {p}{2}}\right\rfloor \left\lfloor {\frac {p-1}{2}}\right\rfloor \left\lfloor {\frac {p-2}{2}}\right\rfloor \left\lfloor {\frac {p-3}{2}}\right\rfloor ,$

which gives values of $1,3,9,18,36,60,100,150$ for $p=1,\ldots ,12;$ see sequence (A000241) in the OEIS. An independent formulation of the conjecture was made by Thomas L. Saaty in 1964. Saaty further verified that the upper bound is achieved for $p\leq 10$ and Pan and Richter showed that it also is achieved for $p=11,p=12.$ If only straight-line segments are permitted, then one needs more crossings. The rectilinear crossing numbers for K₅ through K₁₂ are 1, 3, 9, 19, 36, 62, 102, 153, (A014540) and values up to K₂₇ are known, with K₂₈ requiring either 7233 or 7234 crossings. Further values are collected by the Rectilinear Crossing Number project. Interestingly, it is not known whether the ordinary and rectilinear crossing numbers are the same for bipartite complete graphs. If the Zarankiewicz conjecture is correct, then the formula for the crossing number of the complete graph is asymptotically correct; that is,

$\lim _{p\to \infty }\;cr(K_{p})\;64/p^{4}=1.$

As of January 2012, crossing numbers are known for very few graph families. In particular, except for a few initial cases, the crossing number of complete graphs, bipartite complete graphs, and products of cycles all remain unknown. There has been some progress on lower bounds, as reported by de Klerk et al. (2006).

The Albertson conjecture, formulated by Michael O. Albertson in 2007, states that, among all graphs with chromatic number n, the complete graph K_n has the minimum number of crossings. That is, if the Guy-Saaty conjecture on the crossing number of the complete graph is valid, every n-chromatic graph has crossing number at least equal to the formula in the conjecture. It is now known to hold for n ≤ 16.

Complexity

In general, determining the crossing number of a graph is hard; Garey and Johnson showed in 1983 that it is an NP-hard problem. In fact the problem remains NP-hard even when restricted to cubic graphs and to near-planar graphs (graphs that become planar after removal of a single edge). More specifically, determining the rectilinear crossing number is complete for the existential theory of the reals.

On the positive side, there are efficient algorithms for determining if the crossing number is less than a fixed constant k — in other words, the problem is fixed-parameter tractable. It remains difficult for larger k, such as |V|/2. There are also efficient approximation algorithms for approximating cr(G) on graphs of bounded degree. In practice heuristic algorithms are used, such as the simple algorithm which starts with no edges and continually adds each new edge in a way that produces the fewest additional crossings possible. These algorithms are used in the Rectilinear Crossing Number distributed computing project.

Crossing numbers of cubic graphs

The smallest cubic graphs with crossing numbers 1–8 are known (sequence A110507 in the OEIS). The smallest 1-crossing cubic graph is the complete bipartite graph K_3,3, with 6 vertices. The smallest 2-crossing cubic graph is the Petersen graph, with 10 vertices. The smallest 3-crossing cubic graph is the Heawood graph, with 14 vertices. The smallest 4-crossing cubic graph is the Möbius-Kantor graph, with 16 vertices. The smallest 5-crossing cubic graph is the Pappus graph, with 18 vertices. The smallest 6-crossing cubic graph is the Desargues graph, with 20 vertices. None of the four 7-crossing cubic graphs, with 22 vertices, are well known. The smallest 8-crossing cubic graphs include the Nauru graph and the McGee graph or (3,7)-cage graph, with 24 vertices.

In 2009, Exoo conjectured that the smallest cubic graph with crossing number 11 is the Coxeter graph, the smallest cubic graph with crossing number 13 is the Tutte–Coxeter graph and the smallest cubic graph with crossing number 170 is the Tutte 12-cage.

The crossing number inequality

The very useful crossing number inequality, discovered independently by Ajtai, Chvátal, Newborn, and Szemerédi and by Leighton, asserts that if a graph G (undirected, with no loops or multiple edges) with n vertices and e edges satisfies

$e>7n,\,$

then we have

$\operatorname {cr} (G)\geq {\frac {e^{3}}{29n^{2}}}.\,$

The constant 29 is the best known to date, and is due to Ackerman; the constant 7.5 can be lowered to 4, but at the expense of replacing 29 with the worse constant of 64.

The motivation of Leighton in studying crossing numbers was for applications to VLSI design in theoretical computer science. Later, Székely also realized that this inequality yielded very simple proofs of some important theorems in incidence geometry, such as Beck's theorem and the Szemerédi-Trotter theorem, and Tamal Dey used it to prove upper bounds on geometric k-sets.

For graphs with girth larger than 2r and e ≥ 4n, Pach, Spencer and Tóth demonstrated an improvement of this inequality to

$\operatorname {cr} (G)\geq c_{r}{\frac {e^{r+2}}{n^{r+1}}}.\,$

Proof of crossing number inequality

We first give a preliminary estimate: for any graph G with n vertices and e edges, we have

$\operatorname {cr} (G)\geq e-3n.\,$

To prove this, consider a diagram of G which has exactly cr(G) crossings. Each of these crossings can be removed by removing an edge from G. Thus we can find a graph with at least $e-\operatorname {cr} (G)$ edges and n vertices with no crossings, and is thus a planar graph. But from Euler's formula we must then have $e-\operatorname {cr} (G)\leq 3n$, and the claim follows. (In fact we have $e-\operatorname {cr} (G)\leq 3n-6$ for n ≥ 3).

To obtain the actual crossing number inequality, we now use a probabilistic argument. We let 0 < p < 1 be a probability parameter to be chosen later, and construct a random subgraph H of G by allowing each vertex of G to lie in H independently with probability p, and allowing an edge of G to lie in H if and only if its two vertices were chosen to lie in H. Let $e_{H}$ denote the number of edges of H, and let $n_{H}$ denote the number of vertices.

Now consider a diagram of G with cr(G) crossings. We may assume that any two edges in this diagram with a common vertex are disjoint, otherwise we could interchange the intersecting parts of the two edges and reduce the crossing number by one. Thus every crossing in this diagram involves four distinct vertices of G.

Since H is a subgraph of G, this diagram contains a diagram of H; let $\operatorname {cr} _{H}$ denote the number of crossings of this random graph. By the preliminary crossing number inequality, we have

$\operatorname {cr} _{H}\geq e_{H}-3n_{H}.$

Taking expectations we obtain

${\mathbb {E}}(\operatorname {cr} _{H})\geq {{\mathbb {E}}(e_{H})}-3{\mathbb {E}}(n_{H}).$

Since each of the n vertices in G had a probability p of being in H, we have ${\mathbb {E}}(n_{H})=pn$. Similarly, since each of the edges in G has a probability $p^{2}$ of remaining in H (since both endpoints need to stay in H), then ${\mathbb {E}}(e_{H})=p^{2}e$. Finally, every crossing in the diagram of G has a probability $p^{4}$ of remaining in H, since every crossing involves four vertices, and so ${\mathbb {E}}(\operatorname {cr} _{H})=p^{4}\operatorname {cr} (G)$. Thus we have

$p^{4}\operatorname {cr} (G)\geq p^{2}e-3pn.\,$

If we now set p to equal 4n/e (which is less than one, since we assume that e is greater than 4n), we obtain after some algebra

$\operatorname {cr} (G)\geq e^{3}/64n^{2}.\,$

A slight refinement of this argument allows one to replace 64 by 33.75 when e is greater than 7.5 n.

See also

• 1-planar graph