论文信息 - Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30

Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30

There are two properties shared by all known crossing-minimizing geometric drawings of K"n, for n a multiple of 3. First, the underlying n-point set of these drawings minimizes the number of (@?k)-edges, that means, has exactly 3(k+22)(@?k)-edges, for all 0@?k

[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[2] József Balogh,et al. An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn , 2008, J. Comb. Theory, Ser. A.

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

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

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

[6] József Balogh,et al. k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn , 2006, Discret. Comput. Geom..

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

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

[9] Richard Pollack,et al. On the Combinatorial Classification of Nondegenerate Configurations in the Plane , 1980, J. Comb. Theory, Ser. A.

[10] Jesús Leaños,et al. The maximum number of halving lines and the rectilinear crossing number of Kn for n , 2008, Electron. Notes Discret. Math..

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

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