Paperlane

no. 16 · Tuesday 17 November 2026

Crossing Numbers of Complete Graphs: the independent odd crossing number

Marcus Schaefer and Daniel Stefankovic

math.CO

Abstract

We show that the Harary–Hill bound on the crossing number of complete graphs as well as the Zarankiewwicz bound on the crossing number of complete bipartite graphs, both recently established by OpenAI, also hold for the independent odd crossing number. This implies that the same bounds hold for several other crossing number variants such as the (independent) algebraic crossing number and the (independent) pair crossing number.

fields
Combinatorics
pdf ↗ page arXiv:2611.21516 ↗