Special numbers of crossings for complete graphs Original Research Article

Cycle drawings of Kn use edges either inside or outside of a convex n-gon. The smallest n such that a drawing of Kn exists and a cycle drawing with the same number of crossings does not exist is proved to be at most 14, and equality is conjectured.