The rectilinear crossing number of K_{28}
Year: 2026
Type: preprint
Abstract: Place 28 points in the plane with no three collinear, and join every pair by a line segment. Weprove that the minimum number of crossing pairs of segments is 7,234. The previous lower boundwas 7,233. If a drawing had only 7,233 crossings, exactly two of its 19-point subsets would havemore than three vertices on their convex hulls. These subsets determine three groups of sizes 9, 9,and 10. As a line of projection rotates, each group records the order of its points as it passes theother two groups. For two groups the records fill a rectangle in which every cell must contain adifferent pair of points. A computer enumeration shows that these records cannot supply the 50within-group pairs whose lines would have to split the other 26 points equally.
Author: Sadhu, Ankan
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234829282
