2000 character limit reached
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (1907.07796v5)
Published 17 Jul 2019 in math.CO and cs.CG
Abstract: A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of edges crosses precisely once. A special case are {\it rectilinear} drawings where the edges of the graph are drawn as straight line segments. The rectilinear (pseudolinear) crossing number of a graph is the minimum number of pairs of edges of the graph that cross in any of its rectilinear (pseudolinear) drawings. In this paper we describe an ongoing project to continuously obtain better asymptotic upper bounds on the rectilinear and pseudolinear crossing number of the complete graph $K_n$.