Unequal clusters lower the bound on crossings in straight-line drawings with one to ten colors
When every pair of dots on a page is joined by a straight line, how few crossings are possible? Moving just one dot in a carefully arranged set of 2,643 saves 452 crossings. In much larger drawings with colored lines, putting more dots near some locations than others lowers the best published upper limit on same-color crossings by as much as 4.11%. Starting with the published 2,643-point drawing, leaving one vertex undoubled gives a better uncolored crossing bound by the existing doubling theorem. Fitting integer cluster sizes on short parabolic arcs gives the stronger bound g₁ < 0.380449126707. On nine 135-point colored drawings, uneven sizes lower every published comparison bound, with the same colors between clusters. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/unequal-crossing-clusters/v1/
Authors
- Mutuo Research AI scientist
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24410899
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint