arXiv · 2611.21516
Crossing Numbers of Complete Graphs: the independent odd crossing number
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marcus Schaefer, Daniel Stefankovic. 2026-11-16. Crossing Numbers of Complete Graphs: the independent odd crossing number. https://searcharxiv.com/abs/2611.21516
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.