Erase the Drawing, Keep the Order—and Count Every Crossing
A combinatorial method turns local edge orders into a sharp lower bound on crossings, settling a long-standing complete-graph conjecture.
combinatorial proof
A combinatorial method turns local edge orders into a sharp lower bound on crossings, settling a long-standing complete-graph conjecture.