Skip to main content
SpringerLink
Log in

Covering simply connected regions by rectangles

  • Published:
Combinatorica Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Chaiken, D. J. Kleitman, M. Saks andJ. Shearer, Covering regions by rectangles,SIAM J. on Algebraic and Discrete Methods,2 (1981), 394–410.

    Article  MATH  MathSciNet  Google Scholar 

  2. F. R. K. Chung,personal communication.

  3. E. Győri, A minimax theorem on intervals,J. Combinatorial Theory B,37 (1984), 1–9.

    Article  Google Scholar 

  4. E. Szemerédi,personal communication.

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, 1364, Budapest, Hungary

    E. Győri

Authors
  1. E. Győri
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by MEV (Budapest).

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579442

AMS subject classification (1980)

Search

Navigation