General-position sets and linear hypergraphs
We prove that every linear hypergraph on $N$ vertices with edge sizes $O(\sqrt N)$ and $O(N^2\log N)$ triples contained in its edges has a subset of size $\Omega(\sqrt N)$ meeting each edge in at most two vertices. As an application, every set of $N$ planar points with at most $\sqrt N$ collinear points contains $\Omeg...