Rectangle Divided into Incomparable Subrectangles

Theorem

Let $R$ be a rectangle.

Let $R$ be divided into $n$ smaller rectangles which are pairwise incomparable.

Then $n \ge 7$.

The smallest rectangle with integer sides that can be so divided into rectangles with integer sides is $13 \times 22$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 1975 -- 1976: A.C.C. Yao, E.M. Reingold and B. Sands: Tiling with Incomparable Rectangles (Journal of Recreational Mathematics Vol. 8: pp. 112 – 119)

• 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $7$
• 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $7$