Article contents
Thinnest Packing of Cubes with a Given Number of Neighbours
Published online by Cambridge University Press: 20 November 2018
Extract
As a contribution to various investigations [1-11] about packing of convex bodies with certain conditions imposed on the number of neighbours of each body, V. Chvátal [12] recently proved the following theorem: If in a packing of translates of a square each square has at least six neighbours then the density of the packing is at least 11/15.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1977
References
- 2
- Cited by