Skip to main content
Book Chapter

The rectilinear crossing number of K n : Closing in (or are we?)

Springer New York, (2013), 5-18
DOI: 10.1007/978-1-4614-0110-0_2
23Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The calculation of the rectilinear crossing number of complete graphs is an important open problem in combinatorial geometry, with important and fruitful connections to other classical problems. Our aim in this chapter is to survey the body of knowledge around this parameter.

Cite

CITATION STYLE

APA

Ábrego, B. M., Fernández-Merchant, S., & Salazar, G. (2013). The rectilinear crossing number of K n : Closing in (or are we?). In Thirty Essays on Geometric Graph Theory (Vol. 9781461401100, pp. 5–18). Springer New York. https://doi.org/10.1007/978-1-4614-0110-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free