The densest packing of 19 congruent circles in a circle
It is proved that the densest packing of 19 congruent circles in a circle is the easy conjectured one: a circle in the center, six touching it around and twelve still around as vertices of a regular dodecagon. The proof uses a Bateman-Erdős approach (originally designed for finding the Besicovitch number \(\beta_2=19\)) and author's useful geometrical lemma together with the known optimality results for packing 7, 8, 9, and 10 circles.
scientific article; zbMATH DE number 1270430