A Better Bound for the Pair-Crossing Number



The crossing number cr(G) of a graph G is the minimum possible number of edge crossings in a drawing of G, and the pair-crossing number pair-cr(G) is the minimum possible number of crossing pairs of edges in a drawing of G. Clearly, pair-cr(G) ≤ cr(G). We show that for any graph G, \(\mathrm{cr}(G) = O(\text{ pair-cr}{(G){}^{7/4}\log }^{3/2}(\text{ pair-cr}(G)))\).



The author is very grateful to the anonymous referee for pointing out several typos and errors in the calculation, and for some other useful remarks.

The author was supported by OTKA Grants K-83767 and K-102029.


  1. 1.
    P. Brass, W. Moser, J. Pach, Research Problems in Discrete Geometry (Springer, New York, 2005)MATHGoogle Scholar
  2. 2.
    J. Fox, J. Pach, Separator theorems and Turán-type results for planar intersection graphs. Adv. Math. 219, 1070–1080 (2008)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    J. Fox, J. Pach, A separator theorem for string graphs and its applications, in WALCOM: Algorithms and Computation. Lecture Notes in Computer Science, vol. 5431 (Springer, Berlin, 2009), pp. 1–14. Also in: Combinatorics, Probability and Computing, vol. 19 (2010), pp. 371–390Google Scholar
  4. 4.
    R.J. Lipton, R.E. Tarjan, A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177–189 (1979)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    J. Pach, G. Tóth, Which crossing number is it anyway? J. Combin. Theor. Ser. B 80, 225–246 (2000)MATHCrossRefGoogle Scholar
  6. 6.
    J. Pach, G. Tóth, Thirteen problems on crossing numbers. Geombinatorics 9, 194–207 (2000)MathSciNetMATHGoogle Scholar
  7. 7.
    M. Pelsmajer, M. Schaefer, D. Štefankovič, Removing independently even crossings. SIAM J. Discrete Math. 24, 379–393 (2010)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    G. Tóth, Note on the pair-crossing number and the odd-crossing number. Discrete Comput. Geom. 39, 791–799 (2008)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    P. Valtr, On the pair-crossing number, in Combinatorial and Computational Geometry, Math. Sci. Res. Inst. Publ., vol. 52 (Cambridge University Press, Cambridge, 2005), pp. 569–575Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Rényi InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations