MathDB
Geometric combinatorics with rectangles in the cartesian plane

Source: Germany 2019, Problem 3

June 20, 2019
geometryrectanglecombinatoricsanalytic geometry

Problem Statement

In the cartesian plane consider rectangles with sides parallel to the coordinate axes. We say that one rectangle is below another rectangle if there is a line gg parallel to the xx-axis such that the first rectangle is below gg, the second one above gg and both rectangles do not touch gg.
Similarly, we say that one rectangle is to the right of another rectangle if there is a line hh parallel to the yy-axis such that the first rectangle is to the right of hh, the second one to the left of hh and both rectangles do not touch hh.
Show that any finite set of nn pairwise disjoint rectangles with sides parallel to the coordinate axes can be enumerated as a sequence (R1,,Rn)(R_1,\dots,R_n) so that for all indices i,ji,j with 1i<jn1 \le i<j \le n the rectangle RiR_i is to the right of or below the rectangle RjR_j