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

•  
• Overview
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

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. © Springer Science%2bBusiness Media New York 2013. All rights are reserved.

authors

• Fernández-Merchant S.
• Salazar Anaya Gelasio
• Ábrego B.M.

publication date

• 2013-01-01

published in

• Thirty Essays on Geometric Graph Theory  Book

Identity

Digital Object Identifier (DOI)

• 10.1007/978-1-4614-0110-0_2

Additional Document Info

start page

• 5

end page

• 18

volume

• 9781461401100