On a Heilbronn-type problem (Q932652): Difference between revisions

Let \(F\) be a planar convex figure with area \(| F| \) and let \(G(n,F)\) denote the smallest number such that from any \(n\) points of \(F\) one can find \(G(n,F)\) triangles with area less than or equal to \(| F| /4\). The authors prove \(G(5,T)=3\) for any triangle \(T\) and \(G(5,P)=2\) for any parallelogram \(P\). For any convex figure \(F\) with \(G(n,F)\geq 1\) implying \(n=6\) the authors prove \(G(6,F)=4\).