Skip to main content
Springer Nature Link
Log in

A Lower Bound for the Rectilinear Crossing Number

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We give a new lower bound for the rectilinear crossing number of the complete geometric graph K n . We prove that and we extend the proof of the result to pseudolinear drawings of K n .

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. In: Proc. 18th Ann ACM Symp Comp Geom., Barcelona Spain, 2002, pp. 19–24

  2. Brodsky, A., Durocher, S., Gethner, E.: Toward the rectilinear crossing number of K n : new drawings, upper bounds, and asymptotics. Discrete Math. 262, 59–77 (2003)

    Google Scholar 

  3. Guy, R.K.: The decline and fall of Zarankiewicz's theorem. In: Harary, F. (ed.), Proc. Proof Techniques in Graph Theory, New York, Academic Press, 1969, pp. 63–69

  4. Goodman, J.E., Pollack, R.: Semispaces of configurations, cell complexes of arrangements in P2. J. Combin. Theory Ser. A 32, 1–19 (1982)

    Google Scholar 

  5. Goodman, J.E., Pollack, R.: A combinatorial version of the isotopy conjecture. In: Goodman, J.E., Lutwak, E., Malkevitch, J., Pollack R., (eds.), Discrete Geometry and Convexity, (Ann. New York Acad. Sci., vol. 440), 1985, pp. 12–19

  6. Jensen, H.F.: An upper bound for the rectilinear crossing number of the complete graph. J. Combin. Theory Ser B 10, 212–216 (1971)

    Google Scholar 

  7. Lovász, L., Vesztergombi, K., Wagner, U., Welzl, E.: Convex quadrilaterals and k-sets. In: Pach, J. (ed.), Towards a theory of geometric graphs, (Contemporary Mathematics Series, vol. 342), AMS 2004, pp. 139–148

  8. Matoušek, J.: Lectures on Discrete Geometry. New York, N.Y.: Springer, 2002

  9. Mnëv, N.E.: On manifolds of combinatorial types of projective configurations and convex polyhedra. Soviet Math. Dokl. 32, 335–337 (1985)

    Google Scholar 

  10. Pach, J., Tóth, G.: Thirteen problems on crossing numbers. Geombinatorics 9, 194–207 (2000)

    Google Scholar 

  11. Singer, D.: Rectilinear crossing numbers. Manuscript, 1971

  12. Wagner, U.: On the rectilinear crossing number of complete graphs. In: Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA), 2003, pp. 583–588

  13. Zarankiewicz, K.: On a problem of P. Turán concerning graphs. Fund. Math. 41, 137–145 (1954)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, California State University Northridge, 18111 Nordhoff, St. Northridge, CA, 91330-8313, USA

    Bernardo M. Ábrego & Silvia Fernández-Merchant

Authors
  1. Bernardo M. Ábrego
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Silvia Fernández-Merchant
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Bernardo M. Ábrego.

Additional information

Dedicated to the memory of our good friend and mentor Víctor Neumann-Lara.

Received: April, 2003

Final version received: March 18, 2005

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ábrego, B., Fernández-Merchant, S. A Lower Bound for the Rectilinear Crossing Number. Graphs and Combinatorics 21, 293–300 (2005). https://doi.org/10.1007/s00373-005-0612-5

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0612-5

Keywords