A rectangle is partitioned into finitely many small rectangles. We call a point a cross point if it belongs to four different small rectangles. We call a segment on the obtained diagram maximal if there is no other segment containing it. Show that the number of maximal segments plus the number of cross points is 3 more than the number of small rectangles. geometryrectanglecombinatorics unsolvedcombinatorics