The densest packing of 19 congruent circles in a circle
type: Item
instance of: scholarly article
title: The densest packing of 19 congruent circles in a circle
zbMATH Open document ID: 0927.52024
DOI: 10.1023/A:1005091317243
author: Ferenc Fodor
published in: Geometriae Dedicata
publication date: 1999-12-06T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 52C40
zbMATH DE Number: 1270430
zbMATH Keywords: disc
zbMATH Keywords: packing
zbMATH Keywords: density
zbMATH Keywords: densest circle packing
reviewed by: Peter Boyvalenkov
MaRDI profile type: Publication
full work available at URL: a:1005091317243
OpenAlex ID: W1549020821
description: scientific article; zbMATH DE number 1270430