Minimum Crossing Numbers in Graph Theory

• Minimum crossing number is a graph invariant defined as the minimum number of edge intersections over all planar drawings, crucial for assessing drawing efficiency and applications in network design.
• The study employs the Crossing Lemma, midrange estimates, and various drawing models like rectilinear and convex to establish tight asymptotic bounds for different graph classes.
• Recent research leverages algorithmic decompositions and explicit constructions in specialized families, enhancing our understanding of crossing-critical graphs and computational complexity.

The minimum crossing number of a graph—the least number of edge crossings in any planar drawing—is a cornerstone parameter in topological graph theory and discrete geometry, deeply connected to extremal combinatorics, algorithmic complexity, surface topology, and structural graph theory. Its study encompasses a variety of drawing models (topological, rectilinear, convex), classes of graphs (minor-closed, bounded treewidth, multipartite, crossing-critical), and complexity-theoretic as well as structural phenomena.

1. Foundational Definitions and Crossing Lemmas

For a finite simple graph $G$, the (standard) crossing number, denoted $\mathrm{cr}(G)$, is the minimum number of pairwise edge crossings over all drawings of $G$ in the plane such that vertices are mapped to points, edges to simple curves, and no three edges cross at a single non-endpoint. Important variants include the rectilinear crossing number $\overline{\mathrm{cr}}(G)$ (edges drawn as straight segments), convex crossing number (vertices in convex position), and minor crossing number $\mathrm{mcr}(G)$ (minimum of $\mathrm{cr}(H)$ over all $H$ such that $G$ is a minor of $H$) (Dujmović et al., 2018, Bokal et al., 2011).

The quantitative backbone of the subject is the Crossing Lemma, originally due to Ajtai, Chvátal, Newborn, Szemerédi, and independently Leighton, giving for simple graphs: $$e \geq 4n \implies \mathrm{cr}(G) \geq \frac{1}{64} \frac{e^3}{n^2}$$ where $\mathrm{cr}(G)$0, $\mathrm{cr}(G)$1 (Toth, 17 Sep 2025). The lower bound is tight up to constant factors, as demonstrated by random geometric constructions. Numerous refinements adjust constants (down to $\mathrm{cr}(G)$2) for larger minimal degree or alternative drawing constraints.

For multigraphs, the crossing lemma generalizes to

$\mathrm{cr}(G)$3

where each pair of vertices is joined by at most $\mathrm{cr}(G)$4 edges (Toth, 17 Sep 2025). Several natural restrictions on the drawing (separated, locally-starlike, single-crossing) are necessary for meaningful lower bounds in the multigraph setting.

2. Midrange and Asymptotic Crossing Estimates

Given the intractability of exact calculation for large classes, structural bounds focus on extremal asymptotics. For large $\mathrm{cr}(G)$5 and edge numbers $\mathrm{cr}(G)$6, the midrange crossing constant $\mathrm{cr}(G)$7 is defined as

$\mathrm{cr}(G)$8

where $\mathrm{cr}(G)$9 is the minimum crossing number over all $G$0-vertex graphs with at least $G$1 edges (Czabarka et al., 2018). Current best bounds place $G$2 in $G$3. This convergence mechanism extends to broad graph classes (PST-classes), including bipartite and $G$4-free graphs, and to rectilinear crossing numbers (Czabarka et al., 2018). For bipartite graphs, Angelini et al. proved $G$5.

The Pach–Spencer–Tóth theorem resolves a general crossing lower bound for graphs with monotone forbidden substructures (e.g., $G$6-free graphs). If every subgraph $G$7 satisfies $G$8 for some $G$9, then for $\overline{\mathrm{cr}}(G)$0: $\overline{\mathrm{cr}}(G)$1 with effective constants $\overline{\mathrm{cr}}(G)$2 (Chen et al., 4 Feb 2025).

3. Structural and Algorithmic Results for Minimum Crossing Numbers

Minor-Closed and Bounded Structure Classes

For $\overline{\mathrm{cr}}(G)$3-minor-free graphs of maximum degree $\overline{\mathrm{cr}}(G)$4 and order $\overline{\mathrm{cr}}(G)$5, Dujmović, Kawarabayashi, Mohar, and Wood establish

$\overline{\mathrm{cr}}(G)$6

with $\overline{\mathrm{cr}}(G)$7 depending on the excluded minor and arising from the Graph Minors structure theorem (Dujmović et al., 2018). This is tight up to constants in both parameters. The argument exploits clique-sum decompositions, almost-embeddability, and localized routing strategies. In the rectilinear and convex settings, similar $\overline{\mathrm{cr}}(G)$8 bounds are achievable for broad classes—excluding single-crossing minors, or having bounded pathwidth respectively (Dujmović et al., 2024, Dujmović et al., 2018).

For rectilinear crossing number, the result generalizes and sharpens previous $\overline{\mathrm{cr}}(G)$9 bounds to $\mathrm{mcr}(G)$0, including for planar-plus-apex and bounded-treewidth families, via a combination of structural theorems and explicit straight-line clique-sum constructions. Constructions based on blow-ups of $\mathrm{mcr}(G)$1 demonstrate the asymptotic optimality (Dujmović et al., 2024).

Sharp Lower Bounds in Specialized Classes

For maximal 1-plane graphs of connectivity $\mathrm{mcr}(G)$2 and $\mathrm{mcr}(G)$3 vertices, sharp lower bounds are established: $\mathrm{mcr}(G)$4 with infinite families achieving these for most $\mathrm{mcr}(G)$5 (Ouyang et al., 30 Apr 2025). These results reveal a hierarchy: increasing connectivity forces higher unavoidable crossing numbers, witnessed by explicit recursive or Cartesian-product-based constructions.

Crossing-Critical Graphs

A $\mathrm{mcr}(G)$6-crossing-critical graph satisfies $\mathrm{mcr}(G)$7 and $\mathrm{mcr}(G)$8 for every edge $\mathrm{mcr}(G)$9. The best known general upper bound for the crossing number of $\mathrm{cr}(H)$0-critical graphs is

$\mathrm{cr}(H)$1

improving over the previous $\mathrm{cr}(H)$2 bound of Richter–Thomassen (Barát et al., 2020). The proof employs refined cycle-finding and partitioning procedures in the spirit of the Richter–Thomassen framework, controlled via combinatorial optimization over planarizing edge-sets and delicate redraw-and-count arguments.

The additivity property plays a central role in the construction of complex crossing-critical graphs; the minor crossing number $\mathrm{cr}(H)$3 is additive over arbitrary cuts, and the classical crossing number is additive over edge-cuts of size up to 3, facilitating construction via zip products (Bokal et al., 2011).

4. Explicit and Extremal Constructions

Determining or bounding the minimum crossing number for specific graph families remains a focus.

• For small variants of the hypercube (crossed, locally twisted, Möbius cubes), all are planar for $\mathrm{cr}(H)$4, while at $\mathrm{cr}(H)$5 the crossing numbers are tightly determined: $\mathrm{cr}(H)$6, $\mathrm{cr}(H)$7 (Wang et al., 2011). Methods combine region-counting, parity, and combinatorial decomposition.
• For complete multipartite graphs, Zarankiewicz's construction gives a conjectured optimal upper bound for the bipartite and tripartite cases, with tight rectilinear lower bounds achievable via flag algebra techniques (Gethner et al., 2014). For balanced $\mathrm{cr}(H)$8-partite graphs, limiting ratios between minimum and maximum crossing numbers are given by $\mathrm{cr}(H)$9.
• For the complete graph $H$0, Hill's conjecture identifies the expected value $H$1, verified up to $H$2 in the classical model, and for all $H$3 in the $H$4-monotone (semisimple and weakly semisimple) setting (Balko et al., 2013).

5. Crossing Numbers in Multi-Page, Monotone, and Specialized Drawing Models

• The $H$5-planar crossing number $H$6, minimizing crossings over a decomposition into $H$7 edge-disjoint subgraphs, satisfies

$H$8

for all $H$9, with tightness up to constants (Pach et al., 2016).

• For $G$0-page book drawings of $G$1, recent results specify

$G$2

for $G$3, and drastically improve lower bounds for all $G$4; the gap between lower and upper asymptotic constants is reduced to approximately $G$5 in the ratio to $G$6 (Ábrego et al., 2016). The analysis leverages tight extremal functions for the maximal number of edges in convex graphs of bounded local crossing number.

• In $G$7-monotone or shellable drawings of $G$8, the precise crossing number matches the Hill bound, and a combinatorial forbidden-configuration characterization (on triples and quadruples) delineates the exact class of such drawings (Balko et al., 2013).
• For 2-page book crossing numbers, semidefinite programming techniques yield exact results for $G$9 up to $H$0, and establish that $H$1 (Klerk et al., 2011).

6. Surfaces, Curves, and Topological Variants

Minimum crossing numbers are also studied in the context of surfaces of higher genus, where systems of simple closed curves are considered. For genus $H$2 and $H$3 non-homotopic curves, explicit values for $H$4 up to $H$5 are established, together with the uniqueness of minimizing systems up to homeomorphism and isotopy for $H$6 (Jörg, 2024). Growth is asymptotically quadratic in $H$7, with uniqueness and decomposition properties depending sensitively on $H$8 and $H$9.

The relationship between various crossing parameters—pair-crossing, odd-crossing, minor crossing—has been systematized, with the $$e \geq 4n \implies \mathrm{cr}(G) \geq \frac{1}{64} \frac{e^3}{n^2}$$0-bound demonstrably holding for all nine natural crossing variants for simple graphs (Toth, 17 Sep 2025).

7. Open Problems and Future Directions

• Resolving the precise value of the midrange crossing constant, closing the remaining constant-factor gaps.
• Determining the minimal linear coefficient for the crossing number of $$e \geq 4n \implies \mathrm{cr}(G) \geq \frac{1}{64} \frac{e^3}{n^2}$$1-critical graphs—is $$e \geq 4n \implies \mathrm{cr}(G) \geq \frac{1}{64} \frac{e^3}{n^2}$$2 universally achievable?
• Characterizing the tightest structural conditions guaranteeing $$e \geq 4n \implies \mathrm{cr}(G) \geq \frac{1}{64} \frac{e^3}{n^2}$$3 (or linear) bounds for rectilinear or monotone crossing numbers in various minor-closed or hereditary classes.
• Extending forbidden configuration and signature function characterizations to more general classes (pseudolinear, higher page-number, surface-embedded graphs).
• Algorithmic challenges: achieving efficient deterministic, $$e \geq 4n \implies \mathrm{cr}(G) \geq \frac{1}{64} \frac{e^3}{n^2}$$4-approximation algorithms for the minimum crossing number in general graphs; understanding the hardness landscape with respect to additive and multiplicative approximations (Chuzhoy, 2010).

The minimum crossing number remains a central and richly interconnected invariant, at the interface of graph theory, combinatorial geometry, and algorithms, with broad ramifications and many deep unresolved questions.