Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Schaefer, Marcus, Stefankovic, Daniel
Institutions: DePaul University, University of Rochester
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234706169
