| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656329 | Journal of Combinatorial Theory, Series A | 2007 | 7 Pages |
Abstract
We give a new upper bound for the rectilinear crossing number of the complete geometric graph Kn. We prove that by means of a new construction based on an iterative duplication strategy starting with a set having a certain structure of halving lines.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
