Sciweavers

JCT
2007
103views more  JCT 2007»
13 years 11 months ago
Geometric drawings of Kn with few crossings
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
Bernardo M. Ábrego, Silvia Fernández...