Geodesic
Optimal packings of 13 and 46 unit squares in a square
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. We show that $s(m^2-3)=m$ for $m=4,7$, implying that the most efficient packings of 13 and 46 squares are the trivial ones.
DOI : 10.37236/398
Classification : 52C15, 05B40 
@article{10_37236_398,
     author = {Wolfram Bentz},
     title = {Optimal packings of 13 and 46 unit squares in a square},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/398},
     zbl = {1277.52018},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/398/}
}
TY  - JOUR
AU  - Wolfram Bentz
TI  - Optimal packings of 13 and 46 unit squares in a square
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/398/
DO  - 10.37236/398
ID  - 10_37236_398
ER  - 
%0 Journal Article
%A Wolfram Bentz
%T Optimal packings of 13 and 46 unit squares in a square
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/398/
%R 10.37236/398
%F 10_37236_398
Wolfram Bentz. Optimal packings of 13 and 46 unit squares in a square. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/398

Cité par Sources :