volume 26, issue 3, P375-386 2001
DOI: 10.1007/s00454-001-0036-9
View full text
|
|
Share

## Abstract: In this paper we are interested in the Pentomino Exclusion Problem due to Golomb: Find the minimum number of unit squares to be placed on a k × n chessboard so as to exclude all pentominoes. Using an appropriate definition of density of a tiling, we obtain the asymptotic value of this number, and we establish this number for the k × n chessboard when k ≤ 4.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals