WorksMathematics
General-position sets and linear hypergraphs
Abstract
We prove that every linear hypergraph on vertices with edge sizes and triples contained in its edges has a subset of size meeting each edge in at most two vertices. As an application, every set of planar points with at most collinear points contains points in general position. This proves a conjecture of Payne and Wood and gives the optimal quadratic bound for a geometric Ramsey problem posed by Gowers.