Abstract
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.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference11 articles.
1. Crossing Number Problems
2. Latest results on crossing numbers;Guy,1971
3. The Rectilinear Crossing Number of Kn: Closing in (or Are We?);Ábrego,2013
4. Convex quadrilaterals and k-sets;Lovász,2004
5. A Lower Bound for the Rectilinear Crossing Number
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献