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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Chaiken, D. J. Kleitman, M. Saks andJ. Shearer, Covering regions by rectangles,SIAM J. on Algebraic and Discrete Methods,2 (1981), 394–410.
F. R. K. Chung,personal communication.
E. Győri, A minimax theorem on intervals,J. Combinatorial Theory B,37 (1984), 1–9.
E. Szemerédi,personal communication.
Author information
Authors and Affiliations
Additional information
This research was partially supported by MEV (Budapest).
Rights and permissions
About this article
Cite this article
Győri, E. Covering simply connected regions by rectangles. Combinatorica 5, 53–55 (1985). https://doi.org/10.1007/BF02579442
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02579442