On packing squares with equal squares
type: Item
instance of: scholarly article
title: On packing squares with equal squares
zbMATH Open document ID: 0324.05018
DOI: 10.1016/0097-3165(75)90099-0
author: Ron Graham
author: P. Erdős
published in: Journal of Combinatorial Theory. Series A
publication date: 1975-01-01T00:00:00Z
review text: Let \(\alpha\) be a positive real number. Let \(N(\alpha)\) denote the maximum number of nonoverlapping open unit squares that can be packed into a square of side \(\alpha\). By a clever construction it is shown that \(\alpha ^2-N(\alpha)=0(\alpha ^{7/11})\). The authors raise a number of related questions.
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 52C17
zbMATH DE Number: 3506724
Wikidata QID: Q56169160
MaRDI profile type: Publication
full work available at URL: 0097-3165(75)90099-0
OpenAlex ID: W2045605776
cites work: Packing convex sets into a similar set
Recommended article: On packing unequal squares
Recommended article: On packings of squares and rectangles
Recommended article: On packing unequal rectangles in the unit square
Recommended article: Q4220418
Recommended article: On packing squares into a rectangle
Recommended article: Packing equal squares into a large square
Recommended article: On a Square Packing Problem
Recommended article: Packing Squares in a Square
Recommended article: Efficient packing of unit squares in a square
description: scientific article; zbMATH DE number 3506724