Skip to main content
SpringerLink
Log in

Crossing Numbers

  • Conference paper
Discrete and Computational Geometry (JCDCG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1763))

Included in the following conference series:

Abstract

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.

Supported by the National Science Foundation (USA) and the National Fund for Scientific Research (Hungary).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17, 1–9 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ajtai, M., Chvátal, V., Newborn, M., Szemerédi, E.: Crossing-free subgraphs. Annals of Discrete Mathematics 12, 9–12 (1982)

    MATH  Google Scholar 

  3. Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. Journal of Graph Theory 17, 333–348 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chojnacki, C., Hanani, A.: Über wesentlich unplättbare Kurven im dreidimensionalen Raume. Fund. Math. 23, 135–142 (1934)

    Google Scholar 

  5. Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., Welzl, E.: Combinatorial complexity bounds for arrangements of curves and surfaces. Discrete and Computational Geometry 5, 99–160 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete and Computat. Geometry 19, 373–382 (1998)

    Article  MATH  Google Scholar 

  7. Erdös, P., Guy, R.K.: Crossing number problems. American Mathematical Monthly 80, 52–58 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fáry, I.: On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math. 11, 229–233 (1948)

    MathSciNet  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal of Algebraic and Disccrete Methods 4, 312–316 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  10. Guy, R.K.: The decline and fall of Zarankiewicz’s theorem. In: Proof Techniques in Graph Theory, pp. 63–69. Academic Press, New York (1969)

    Google Scholar 

  11. Kleitman, D.J.: The crossing number of K5, n . Journal of Combinatorial Theory 9, 315–323 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  12. Leighton, T.: Complexity Issues in VLSI. Foundations of Computing Series. MIT Press, Cambridge (1983)

    Google Scholar 

  13. Leighton, F.T.: New lower bound techniques for VLSI. Math. Systems Theory 17, 47–70 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM J. Applied Mathematics 36, 177–189 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pach, J., Agarwal, P.K.: Combinatorial Geometry. J. Wiley and Sons, New York (1995)

    MATH  Google Scholar 

  16. Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16, 111–117 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  17. Pach, J., Sharir, M.: On the number of incidences between points and curves. Combinatorics, Probability and Computing 7, 121–127 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pach, J., Spencer, J., Tóth, G.: New bounds on crossing numbers. In: 15th ACM Symposium on Computational Geometry, pp. 124–133 (1999); Also in: Discrete and Computational Geometry (accepted)

    Google Scholar 

  19. Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17, 427–439 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. Pach, J., Tóth, G.: Which crossing number is it, anyway? In: Proceedings of 39th Annual Symposium on Foundations of Computer Science, Palo Alto, pp. 617–626 (1998)

    Google Scholar 

  21. Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, p. 263. Springer, Heidelberg (1999) (to appear)

    Chapter  Google Scholar 

  22. Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. American Mathematical Monthly, 131–137 (February 1997)

    Google Scholar 

  23. Székel, L.A.: Crossing numbers and hard Erdös problems in discrete geometry. Combinatorics, Probability and Computing 6, 353–358 (1998)

    Article  Google Scholar 

  24. Spencer, J., Szemerédi, E., Trotter, W.T.: Unit distances in the Euclidean plane. In: Bollobás, B. (ed.) Graph Theory and Combinatorics, pp. 293–303. Academic Press, New York (1984)

    Google Scholar 

  25. Szemerédi, E., Trotter, W.T.: Extremal problems in discrete geometry. Combinatorica 3, 381–392 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  26. Turán, P.: A note of welcome. Journal of Graph Theory 1, 7–9 (1977)

    Article  Google Scholar 

  27. Tutte, W.T.: Toward a theory of crossing numbers. Journal of Combinatorial Theory 8, 45–53 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  28. Valtr, P.: On geometric graphs with no k pairwise parallel edges. Discrete and Computational Geometry 19, 461–469 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  29. Woodall, D.R.: Cyclic-order graphs and Zarankiewicz’s crossing-number conjecture. Journal of Graph Theory 17, 657–671 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute, New York University and Hungarian Academy of Sciences,  

    János Pach

Authors
  1. János Pach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku Tokio, Japan

    Jin Akiyama

  2. Ibaraki University, Nakanarusawa, 316-8511, Hitachi Ibaraki, Japan

    Mikio Kano

  3. Department of Mathematics, Tokai University, 3-20-1 Orido, Shimizu, Shizuoka, 424-8610, Japan

    Masatsugu Urabe

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pach, J. (2000). Crossing Numbers. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46515-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67181-7

  • Online ISBN: 978-3-540-46515-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation