Harborth–Mengersen's uncrossed-edge conjecture for crossing-maximal drawings
A simple drawing of is crossing-maximal if it has crossings; an uncrossed edge is an edge crossed by no other edge. Harborth–Mengersen's conjecture. Every crossing-maximal simple drawing of contains an uncrossed edge. The conjecture is verified for in the paper, but remains open in general.
References
- Helena Bergold and Manfred Scheucher, “Investigating Simple Drawings of K_n using SAT”, arXiv:2504.02650 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.