The Rectilinear Crossing Number of K n : Closing in (or Are We?)

The calculation of the rectilinear crossing number of complete graphs is an important open problem in combinatorial geometry, with important and fruitful connections to other classical problems. Our aim in this chapter is to survey the body of knowledge around this parameter.

[1]  H. F. Jensen,et al.  An upper bound for the rectilinear crossing number of the complete graph , 1971 .

[2]  R. Guy.  Crossing numbers of graphs , 1972 .

[3]  Emo Welzl.  More onk-sets of finite sets in the plane , 1986, Discret. Comput. Geom..

[4]  李幼升,et al.  Ph , 1989 .

[5]  Edward R. Scheinerman,et al.  The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometri , 1994 .

[6]  Eric W. Weisstein.  Rectilinear Crossing Number , 1999 .

[7]  Stephane Durocher,et al.  The Rectilinear Crossing Number of K10 is 62 , 2000, Electron. J. Comb..

[8]  Emo Welzl,et al.  Entering and leaving j-facets , 2001, Discret. Comput. Geom..

[9]  Oswin Aichholzer,et al.  The point set order type data base: A collection of applications and results , 2001, CCCG.

[10]  Emo Welzl,et al.  A Continuous Analogue of the Upper Bound Theorem , 2001, Discret. Comput. Geom..

[11]  Franz Aurenhammer,et al.  Enumerating Order Types for Small Point Sets with Applications , 2002, Order.

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

[13]  Hannes Krasser.  Order types of point sets in the plane , 2003 .

[14]  Stephane Durocher,et al.  Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics , 2000, Discret. Math..

[15]  Uli Wagner,et al.  On the rectilinear crossing number of complete graphs , 2003, SODA '03.

[16]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

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

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

[19]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[20]  O. Aichholzer,et al.  On the Crossing Number of Complete Graphs , 2005, Computing.

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

[22]  Jason S. Williford,et al.  On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph , 2007 .

[23]  Bernardo M. Ábrego,et al.  Geometric drawings of Kn with few crossings , 2007, J. Comb. Theory, Ser. A.

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

[25]  Shengjun Pan,et al.  The crossing number of K11 is 100 , 2007, J. Graph Theory.

[26]  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.

[27]  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..

[28]  Jesús Leaños,et al.  A central approach to bound the number of crossings in a generalized configuration , 2008, Electron. Notes Discret. Math..

[29]  Aarnout Brombacher,et al.  Probability... , 2009, Qual. Reliab. Eng. Int..

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

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

[32]  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..

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

[34]  Rectilinear crossing numbers of complete graphs with specific nested sequence of convex hulls , 2013 .