An Improvement of the Lower Bound on the Minimum Number of ≤k-Edges
In this paper, we improve the lower bound on the minimum number of ≤k-edges in sets of n points in general position in the plane when k is close to n2. As a consequence, we improve the current best lower bound of the rectilinear crossing number of the complete graph Kn for some values of n.
2014 ◽
Vol 24
(03)
◽
pp. 177-181
◽
Keyword(s):
2020 ◽
Vol 29
(04)
◽
pp. 2050022
1997 ◽
Vol 6
(3)
◽
pp. 353-358
◽
Keyword(s):
Keyword(s):
Keyword(s):
2014 ◽
Vol 24
(4)
◽
pp. 658-679
◽
Keyword(s):