The Rectilinear Local Crossing Number Of K N

The of a drawing of a graph is the largest number of crossings on any edge of the drawing. In a of a graph, the vertices are points in the plane in general position and the edges are straight-line segments. The of the complete graph , denoted by , is the minimum local crossing number over all rectilinear drawings of .We determine . More precisely, for every ,