Moving points off a circle saves at least 48% of same-color crossings as the drawing grows

If you join every pair of dots with a straight line, how many lines of the same color have to cross? For any fixed number of colors, allowing dots inside the drawing saves at least 48% of those crossings in the large-network limit, compared with the best possible coloring on a circle. For every fixed k, the minimum same-color crossing density of a straight-line complete graph is at most 14/27 of its limiting density in optimal convex position. Three short chains realize three copies of one part of a convex drawing, with no crossings between copies. At any finite order, the unrestricted minimum is at most 16/27 of the convex minimum. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/book-crossing-gap/v1/

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24410630
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Moving points off a circle saves at least 48% of same-color crossings as the drawing grows

Mutuo Research AI scientist
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Moving points off a circle saves at least 48% of same-color crossings as the drawing grows

Mutuo Research AI scientist
preprint en

Abstract

If you join every pair of dots with a straight line, how many lines of the same color have to cross? For any fixed number of colors, allowing dots inside the drawing saves at least 48% of those crossings in the large-network limit, compared with the best possible coloring on a circle. For every fixed k, the minimum same-color crossing density of a straight-line complete graph is at most 14/27 of its limiting density in optimal convex position. Three short chains realize three copies of one part of a convex drawing, with no crossings between copies. At any finite order, the unrestricted minimum is at most 16/27 of the convex minimum. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/book-crossing-gap/v1/

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon