Proves threshold-distance connections minimize crossings in continuous uniform geodesic drawings on the sphere and plane, recovering the conjectured 8/(9π²) bound for finite graphs via smoothing.
New bounds on crossing numbers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Uniform Geodesic Drawings of Graphs
Proves threshold-distance connections minimize crossings in continuous uniform geodesic drawings on the sphere and plane, recovering the conjectured 8/(9π²) bound for finite graphs via smoothing.