论文信息 - There is a unique crossing-minimal rectilinear drawing of K18

There is a unique crossing-minimal rectilinear drawing of K18

Abstract We show that, up to isomorphism, there is a unique crossing-minimal rectilinear drawing of K18. As a consequence we settle, in the negative, the following question from Aichholzer and Krasser: does there always exist an crossing-minimal drawing of K n that contains a crossing-minimal drawing of K n − 1 ?

[1] Jesús Leaños,et al. On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn , 2011, Discret. Comput. Geom..

[2] E. Welzl,et al. Convex Quadrilaterals and k-Sets , 2003 .

[3] Jesús Leaños,et al. Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30 , 2010, Discret. Math..

[4] Oswin Aichholzer,et al. New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn , 2007, Discret. Comput. Geom..

[5] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[6] Bernardo M. Ábrego,et al. A Lower Bound for the Rectilinear Crossing Number , 2005, Graphs Comb..

[7] Oswin Aichholzer,et al. New results on lower bounds for the number of (k)-facets: (extended abstract) , 2007, Electron. Notes Discret. Math..

[8] Oswin Aichholzer,et al. New results on lower bounds for the number of (<=k)-facets , 2008, Eur. J. Comb..

[9] Remco C. Veltkamp,et al. A decade of CGAL , 2007, Comput. Geom..

[10] Oswin Aichholzer,et al. Abstract order type extension and new results on the rectilinear crossing number , 2005, EuroCG.

[11] Jesús Leaños,et al. 3-symmetric and 3-decomposable geometric drawings of Kn , 2010, Discret. Appl. Math..