%0 Publication
%T The Rectilinear Local Crossing Number Of K N
%A Fernandez, Silvia; Abrego, Bernardo
%I Elsevier (Academic Press)
%U doi.org/10.1016/j.jcta.2017.04.003
%R http://localhost/files/8w32r824p
%X 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 ,
%G en
%9 Article
%~ ScholarWorks
%W Cal State