A Crossing Lemma for the Pair-Crossing Number

  • Eyal Ackerman
  • Marcus Schaefer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8871)

Abstract

The pair-crossing number of a graph G, pcr(G), is the minimum possible number of pairs of edges that cross each other (possibly several times) in a drawing of G. It is known that there is a constant c ≥ 1/64 such that for every (not too sparse) graph G with n vertices and m edges \({\mbox{pcr}}(G) \geq c \frac{m^3}{n^2}\). This bound is tight, up to the constant c. Here we show that c ≥ 1/34.2 if G is drawn without adjacent crossings.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ackerman, E.: On topological graphs with at most four crossings per edge (manuscript)Google Scholar
  2. 2.
    Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Combinatorial Theory, Ser. A 114(3), 563–571 (2007)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Aigner, M., Ziegler, G.: Proofs from the Book. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Ajtai, M., Chvátal, V., Newborn, M., Szemerédi, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics. North-Holland Math. Stud., vol. 60, pp. 9–12. North-Holland, Amsterdam (1982)Google Scholar
  5. 5.
    Cranston, D.W., West, D.B.: A guide to discharging (manuscript)Google Scholar
  6. 6.
    Leighton, F.T.: Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks. MIT Press, Cambridge (1983)Google Scholar
  7. 7.
    Matoušsek, J.: Near-optimal separators in string graphs, ArXiv (February 2013)Google Scholar
  8. 8.
    Montaron, B.: An improvement of the crossing number bound. J. Graph Theory 50(1), 43–54 (2005)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Pach, J., Radoičić, R., Tardos, G., Tóth, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Disc. Compu. Geometry 36(4), 527–552 (2006)CrossRefMATHGoogle Scholar
  10. 10.
    Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427–439 (1997)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Pach, J., Tóth, G.: Thirteen problems on crossing numbers. Geombinatorics 9(4), 194–207 (2000)MATHMathSciNetGoogle Scholar
  12. 12.
    Pach, J., Tóth, G.: Which crossing number is it anyway? J. Combin. Theory Ser. B 80(2), 225–246 (2000)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Removing independently even crossings. SIAM J. on Disc. Math. 24(2), 379–393 (2010)CrossRefMATHGoogle Scholar
  14. 14.
    Schaefer, M.: The graph crossing number and its variants: A survey. Electronic Journal of Combinatorics, Dynamic Survey 21 (2013)Google Scholar
  15. 15.
    Schaefer, M., Štefankovič, D.: Decidability of string graphs. J. Comput. System Sci. 68(2), 319–334 (2004)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Eyal Ackerman
    • 1
  • Marcus Schaefer
    • 2
  1. 1.Dept. Math., Physics, and Comp. Sci.University of Haifa at OranimTivonIsrael
  2. 2.School of ComputingDePaul UniversityChicagoUSA

Personalised recommendations