Heilbronn triangle problem in a triangle $\Delta(7)$
The largest possible area of the smallest triangle formed by three of $7$ points in a triangle of unit area.
Value: $\frac{7}{72}$
(≈0.09722222)
lower bound
Checked construction
upper bound
Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence.
A bound is discovered in the literature, or by a certificate submitted here.
Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction).
Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature.
Submit a certificate.
| Date |
Bound |
Discovery |
Best evidence |
| 2006-07 |
$\ge \frac{7}{72}$
(≈0.09722222)
|
D. Cantrell, Heilbronn configurations in the triangle (July 2006), in E. Friedman, The Heilbronn problem for triangles, Erich's Packing Center.
[via E. Friedman, The Heilbronn problem for triangles, Erich's Packing Center, as archived by the Wayback Machine on 2021-03-07.]
|
Checked construction
Certificate heilbronn-triangle-7-lower-7over72,
submitted by daniel-munro, 2026-11-21
[construction from D. Cantrell, Heilbronn configurations in the triangle (July 2006), in E. Friedman, The Heilbronn problem for triangles, Erich's Packing Center.]
|
| 2009-11-23 |
$\le \frac{23}{200}$
(≈0.115)
|
F. De Comité and J.-P. Delahaye, Automated proofs in geometry: computing upper bounds for the Heilbronn problem for triangles, arXiv:0911.4375.
|
Literature
|
| 2019-08-26 |
$\le \frac{7}{72}$
(≈0.09722222)
|
Z. Zeng and L. Chen, Determining the Heilbronn configuration of seven points in triangles via symbolic computation, in Computer Algebra in Scientific Computing (CASC 2019), Lecture Notes in Computer Science 11661, Springer (2019) 458-477.
|
Literature
|