Name
Abstract | ||
|---|---|---|
We prove that the ratio of the minimum number of rectangles covering a simply connected board (polyomino)B and the maximum number of points inB no two of which are contained in a common rectangle is less than 2. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1007/BF02579442 | Combinatorica |
Keywords | Field | DocType |
05 C 70, 05 B 50, 05 C 65 | Discrete mathematics,Combinatorics,Simply connected space,Rectangle,Polyomino,Mathematics | Journal |
Volume | Issue | ISSN |
5 | 1 | 1439-6912 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ervin Györi | 1 | 88 | 21.62 |