On a Heilbronn-type problem
From MaRDI portal
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\).
Recommendations
Cites work
- A Lower Bound for Heilbronn'S Problem
- Developments in Heilbronn's triangle problem
- scientific article; zbMATH DE number 638924 (Why is no real title available?)
- scientific article; zbMATH DE number 866006 (Why is no real title available?)
- Maximizing the Smallest Triangle Made by N Points in a Square
- On a Problem of Heilbronn
- On a Problem of Heilbronn, II
- On a Problem of Heilbronn, III
- On Heilbronn's Triangle Problem
- Research Problems in Discrete Geometry
Cited in
(5)
This page was built for publication: On a Heilbronn-type problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932652)
