Heilbronn triangle problem in a square $H(6)$
The largest possible area of the smallest triangle formed by three of $6$ points in a unit square.
Value: $\frac{1}{8}$ (≈0.125) 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 |
|---|---|---|---|
| 1972-05 | $\ge \frac{1}{8}$ (≈0.125) | M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144. |
Checked construction
Certificate heilbronn-square-6-lower-1over8, submitted by daniel-munro, 2026-11-21 [construction from M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144.] |
| 1992 | $\le \frac{1}{8}$ (≈0.125) |
L. Yang, J. Zhang and Z. Zeng, A conjecture on the first several Heilbronn numbers and a computation, Chinese Annals of Mathematics, Series A 13 (1992) 503-515 (in Chinese).
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.] |
Literature |