Clumsy packing of dominoes

DOI10.1016/0012-365X(88)90028-3MaRDI QIDQ1114697zbMATH OpenFDO

Authors S. H. Smith

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(88)90028-3

zbMATH Keywords

chessboarddominoes

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

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.

Recommendations

• Packing polyominoes clumsily
• Mistilings with dominoes
• Dominoes
• Arrangements of marked dominoes
• Falling Dominoes
• Sandpiles and dominos

Cites work

• An Analysis of the Greedy Heuristic for Independence Systems
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• Perfect matchings in hexagonal systems

Cited in

(5)

• Mistilings with dominoes
• Clumsy packings of graphs
• Packing polyominoes clumsily
• A formula for the content of a domino of three faces
• scientific article; zbMATH DE number 7824069 (Why is no real title available?)

This page was built for publication: Clumsy packing of dominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114697)