Packing $35$ unit circles in a square
The side of the smallest square into which $35$ unit circles (of radius 1) can be packed.
Lower bound:
${\approx}11.4639440325$
Literature
Upper bound:
$8+\sqrt{2}+\sqrt{6}$
(≈11.8637)
Checked construction
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 |
|---|---|---|---|
| 1961-05 | $\ge {\approx}11.2579$ | Groemer, H. (1960). Über die Einlagerung von Kreisen in einen konvexen Bereich. Math. Z., 73, 285-294; Oler, N. (1961). A finite packing problem. Canad. Math. Bull., 4, 153-155. | Literature |
| 1996-04 | $\le 8+\sqrt{2}+\sqrt{6}$ (≈11.8637) | R. L. Graham, B. D. Lubachevsky, Repeated patterns of dense packings of equal disks in a square, Electronic Journal of Combinatorics 3 (1996) #R16, arXiv:math/0406394. |
Checked construction
Certificate circle-in-square-35-upper-8-sqrt2-sqrt6, submitted by daniel-munro, 2026-11-15 |
| 2021-09-29 | $\ge {\approx}11.4639440325$ | M. Cs. Markót, Improved interval methods for solving circle packing problems in the unit square, Journal of Global Optimization 81 (2021) 773-803. | Literature |