Title of article
Geometric drawings of with few crossings
Author/Authors
ءbrego، نويسنده , , Bernardo M. and Fernلndez-Merchant، نويسنده , , Silvia، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
373
To page
379
Abstract
We give a new upper bound for the rectilinear crossing number cr ¯ ( n ) of the complete geometric graph K n . We prove that cr ¯ ( n ) ⩽ 0.380559 ( n 4 ) + Θ ( n 3 ) by means of a new construction based on an iterative duplication strategy starting with a set having a certain structure of halving lines.
Keywords
Complete Graph , Convex quadrilateral , rectilinear crossing number , Geometric graph , crossing number
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2007
Journal title
Journal of Combinatorial Theory Series A
Record number
1531182
Link To Document