Die minimale 3-Nachbarnpackung kongruenter Kreise (Q791161): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q168660 |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / reviewed by | |||
Property / reviewed by: August Florian / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 02:14, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Die minimale 3-Nachbarnpackung kongruenter Kreise |
scientific article |
Statements
Die minimale 3-Nachbarnpackung kongruenter Kreise (English)
0 references
1983
0 references
Let P be a packing of congruent circles in the Euclidean plane. Two circles of the packing with a common boundary point are said to be neighbours. If each circle of P has exactly \(n(\geq 2)\) neighbours, then P is called an n-neighbour packing. It is easy to see that an n-neighbour packing does not exist for \(n>6\), and consists of infinitely many circles for \(n=4,5\) and 6. The main result of the present paper states that the minimal number of circles in a 3-neighbour packing is 16. The proof makes essential use of the properties of a graph associated with the packing. \{Reviewer's remark: L. Fejes Tóth showed that the density of any 5- neighbour packing of equal circles is at least \(\sqrt{3\pi}/7\) [Period. Math. Hungar. 4, 221-229 (1973; Zbl 0274.52015)], whereas 4-neighbour packings exist that have density 0.\}
0 references
packing of circles
0 references
number of neighbours
0 references
graph associated with the packing
0 references