On the General Position Subset Selection Problem

From MaRDI portal



Abstract: Let f(n,ell) be the maximum integer such that every set of n points in the plane with at most ell collinear contains a subset of f(n,ell) points with no three collinear. First we prove that if ellleqO(sqrtn) then f(n,ell)geqOmega(sqrtfracnlnell). Second we prove that if ellleqO(n(1−epsilon)/2) then f(n,ell)geqOmega(sqrtnlogelln), which implies all previously known lower bounds on f(n,ell) and improves them when ell is not fixed. A more general problem is to consider subsets with at most k collinear points in a point set with at most ell collinear. We also prove analogous results in this setting.





Cited in
(38)








This page was built for publication: On the General Position Subset Selection Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408587)