Abstract
The maximum number of elements in an antirectangle of a convex board equals the minimum number of rectangles it takes to cover that board. It is shown here that the dual of this theorem, that the minimum number of antirectangles needed to cover a convex board equals the maximum size of any rectangle of the board, is not generally true.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
