2 Two Important Bounds and Their Applications

The crossing number of a graph G is the minimum number of crossings in a drawing of G. The determination of the crossing number is an NP-complete problem. We present two general lower bounds for the crossing number, and survey their applications and generalizations.

[1]  Jerald A. Kabell,et al.  The crossing numbers of some generalized Petersen graphs. , 1981 .

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

[3]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

[4]  János Pach,et al.  Combinatorial Geometry , 2012 .

[5]  Carsten Thomassen,et al.  Minimal Graphs with Crossing Number at Least k , 1993, J. Comb. Theory, Ser. B.

[6]  Paul Turán,et al.  A note of welcome , 1977, J. Graph Theory.

[7]  Martin Kochol,et al.  Construction of crossing-critical graphs , 1987, Discret. Math..

[8]  Micha Sharir,et al.  Quasi-planar graphs have a linear number of edges , 1995, GD.

[9]  Daniel J. Kleitman,et al.  The crossing number of K5,n , 1970 .

[10]  Pavel Valtr,et al.  On Geometric Graphs with No k Pairwise Parallel Edges , 1997, Discret. Comput. Geom..

[11]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

[12]  Ondrej Sýkora,et al.  On crossing numbers of hypercubes and cube connected cycles , 1993, BIT.

[13]  János Pach,et al.  Graphs drawn with few crossings per edge , 1996, GD.

[14]  R. Bruce Richter,et al.  Cubic graphs with crossing number two , 1988, J. Graph Theory.

[15]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[16]  Douglas R. Woodall,et al.  Cyclic-order graphs and Zarankiewicz's crossing-number conjecture , 1993, J. Graph Theory.

[17]  Tom Jenkyns,et al.  The toroidal crossing number of the complete graph , 1968 .

[18]  Tatsuya Akutsu,et al.  Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets , 1998, Discret. Comput. Geom..

[19]  J. Spencer,et al.  New Bounds on Crossing Numbers , 2000 .

[20]  L. A. Oa,et al.  Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[21]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[22]  Neil Robertson,et al.  Computing the orientable genus of projective graphs , 1995, J. Graph Theory.

[23]  Jozef ŠirÁŇ,et al.  The crossing function of a graph , 1983 .

[24]  Kenneth L. Clarkson,et al.  Combinatorial complexity bounds for arrangements of curves and surfaces , 2015, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[25]  J. Pach,et al.  Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.

[26]  Lowell W. Beineke,et al.  On the crossing numbers of products of cycles and graphs of order four , 1980, J. Graph Theory.

[27]  Bojan Mohar,et al.  Embedding graphs in an arbitrary surface in linear time , 1996, STOC '96.

[28]  A. Owens,et al.  On the biplanar crossing number , 1971 .

[29]  Micha Sharir,et al.  On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.

[30]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[31]  Ch. Chojnacki,et al.  Über wesentlich unplättbare Kurven im dreidimensionalen Raume , 1934 .

[32]  Tamal K. Dey,et al.  Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..

[33]  R. Bruce Richter,et al.  The crossing number of c4 × c4 , 1995, J. Graph Theory.

[34]  László A. Székely,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[35]  E. Szemerédi,et al.  Unit distances in the Euclidean plane , 1984 .

[36]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[37]  C. Zarankiewicz.  On a problem of P. Turan concerning graphs , 1955 .

[38]  Béla Bollobás,et al.  The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..

[39]  N. Sloane,et al.  Proof Techniques in Graph Theory , 1970 .

[40]  Lowell W. Beineke,et al.  The crossing number of C3 × Cn , 1978, J. Comb. Theory, Ser. B.

[41]  P. Erdös,et al.  Crossing Number Problems , 1973 .

[42]  Robin Wilson,et al.  Graph theory and combinatorics , 1979 .

[43]  R. Bruce Richter,et al.  RELATIONS BETWEEN CROSSING NUMBERS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS , 1997 .

[44]  Nathaniel Dean,et al.  Bounds for rectilinear crossing numbers , 1993, J. Graph Theory.

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

[46]  Jj Anos Pach.  Which Crossing Number Is It Anyway? , 1998 .

[47]  In-kyeong Choi.  On straight line representations of random planar graphs , 1992 .

[48]  W. T. Tutte.  Toward a theory of crossing numbers , 1970 .