Clumsy packing of dominoes
type: Item
instance of: scholarly article
title: Clumsy packing of dominoes
zbMATH Open document ID: 0663.05021
DOI: 10.1016/0012-365X(88)90028-3
author: S. H. Smith
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Assume dominoes are placed on an \(n\times n\) chessboard. If there is no room for further dominoes, the board is said to be full. The authors discuss the problem of finding the minimum number d(n) of dominoes lying on a full \(n\times n\) board. It is proved that \(d(n)=n^ 3/3\) if \(3| n\), and \(n^ 2/3+n/111<d(n)<n^ 2/3+n/12+1\) if n is large and \(3\nmid n\). Also similar problems are investigated for triangulated and hexa boards.
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 4083646
zbMATH Keywords: dominoes
zbMATH Keywords: chessboard
reviewed by: Egon Schulte
MaRDI profile type: Publication
cites work: Q3944542
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: Perfect matchings in hexagonal systems
Recommended article: Packing polyominoes clumsily
Recommended article: Mistilings with dominoes
Recommended article: Dominoes
Recommended article: Q3581946
Recommended article: Falling Dominoes
Recommended article: Sandpiles and dominos
description: scientific article; zbMATH DE number 4083646