Work

Crossing Numbers of Complete Graphs: the independent odd crossing number

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.
Language: English
Open Access status: green
OpenAlex ID: W7234706169
Cites: 17
Cited by:
Related to: 10